Не работает модуль
04.10.2012, 19:53. Показов 1121. Ответов 1
Модуль почему-то не работает помогите
Программа без Модуля
| Pascal | 1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
| program my1;
type
masiv=array [1..10,1..10]of integer;
var
m,n,q, i, j, a, z, b: integer;
mas: masiv;
procedure ones(a, b: integer; var sum: integer);
var
i, j: integer;
begin
sum := 0;
for i := a to b do
begin
for j := 1 to m do
begin
sum := sum + mas[i, j];
end;
end;
end;
procedure Two(mas: masiv);
var
i, j, max: integer;
begin
max := 0;
for i := 1 to n do
begin
for j := 1 to m do
begin
if mas[i, j] > max then max := mas[i, j];
end;
end;
writeln('max element: ', max);
for i := 1 to n do
begin
for j := 1 to m do
begin
if mas[i, j] = max then writeln('Nomera max elementoV: ', i, '.', j, ' ');
end;
end;
end;
function Tree(m, n: integer): integer;
var
i, j, sum, kol, k, z: integer;
sr: real;
begin
sum := 0;
for i := 1 to n do
begin
for j := 1 to m do
begin
sum := sum + mas[i, j];
end;
end;
kol := m * n;
sr := sum / kol;
writeln('Srednee arefmeti4eckoe= ', sr:3:3);
for i := 1 to n do
begin
for j := 1 to m do
begin
if sr < mas[i, j] then inc(k);
tree := z;
end;
end;
writeln('B masssive ', k, ' 4isel(a) > sr ');
end;
begin
writeln ('Vvedite razmernost massiva MxN');
readln(m,n);
writeln('MassiV');
for i := 1 to n do
begin
for j := 1 to m do
begin
mas[i, j] := random(10);
write(mas[i, j]:3);
end;
writeln;
end;
writeln('Vvedite K1 and K2');
readln(a, b);
ones(a, b, z);
writeln(z);
two(mas);
q:=Tree(m,n);
end. |
|
Сам модуль
| Pascal | 1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
| unit Unit;
interface
type
masiv=array [1..10,1..10]of integer;
var
m,n,q, i, j, a, z, b: integer;
mas: masiv;
procedure ones(a, b: integer; var sum: integer);
procedure Two(mas: masiv);
function Tree(m, n: integer): integer;
Implementation
procedure ones(a, b: integer; var sum: integer);
var
i, j: integer;
begin
sum := 0;
for i := a to b do
begin
for j := 1 to m do
begin
sum := sum + mas[i, j];
end;
end;
end;
procedure Two(mas: masiv);
var
i, j, max: integer;
begin
max := 0;
for i := 1 to n do
begin
for j := 1 to m do
begin
if mas[i, j] > max then max := mas[i, j];
end;
end;
writeln('max element: ', max);
for i := 1 to n do
begin
for j := 1 to m do
begin
if mas[i, j] = max then writeln('Nomera max elementoV: ', i, '.', j, ' ');
end;
end;
end;
function Tree(m, n: integer): integer;
var
i, j, sum, kol, k, z: integer;
sr: real;
begin
sum := 0;
for i := 1 to n do
begin
for j := 1 to m do
begin
sum := sum + mas[i, j];
end;
end;
kol := m * n;
sr := sum / kol;
writeln('Srednee arefmeti4eckoe= ', sr:3:3);
for i := 1 to n do
begin
for j := 1 to m do
begin
if sr < mas[i, j] then inc(k);
tree := z;
end;
end;
writeln('B masssive ', k, ' 4isel > sr ');
end;
begin
end. |
|
|
Комментарий модератора |
 |
Используйте теги подсветки кода! |
|
0
|
(
