 Сообщение было отмечено Памирыч как решение
Решение
Проверяй.
| 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
| uses crt;
const
nmax = 20;
type
Vector = array [1..nmax] of integer;
procedure Enter(var A : Vector; n : integer);
var
i : integer;
begin
Writeln('Введите массив: ');
for i := 1 to n do
begin
Write('A[', i, '] = ');
Readln(A[i]);
end;
end;
procedure MaxMin(A : Vector; n : integer; var imin, imax : integer; var max, min : integer);
var
i : integer;
begin
max := A[1]; min := A[1];
imax := 1; imin := 1;
for i := 1 to n do
begin
if max < A[i] then begin max := A[i]; imax := i; end;
if min > A[i] then begin min := A[i]; imin := i; end;
end;
end;
procedure Count(A : Vector; var countp, countm : integer; n : integer);
var
i : integer;
begin
countp := 0; countm := 0;
for i := 1 to n do
begin
if A[i] > 0 then inc(countp);
if A[i] < 0 then inc(countm);
end;
end;
procedure FindFirst(A : Vector; n : integer; var first : integer);
var
i : integer;
begin
i := 1;
first := 0;
while A[i] <= 0 do
inc(i);
first := A[i];
end;
var
A : Vector;
i, n, countp, countm, imax, max, imin, min : integer;
first : integer;
begin
Repeat
Write('Рамзер массива: ');
Readln(n);
until n in [1..nmax];
Enter(A, n);
MaxMin(A, n, imin, imax, max, min);
Writeln('Максимальный элемент: ', max, '[', imax, ']');
Writeln('Минимальный элемент: ', min, '[', imin, ']');
Count(A, countp, countm, n);
if countp < countm then
begin
FindFirst(A, n, first);
if first > 0 then
for i := 1 to n do
begin
if A[i] > 0 then A[i] := A[i] + first;
Write(A[i], ' ');
end else Writeln('Положительных элементов нет!');
end;
Readln;
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
77
78
79
80
81
82
| uses crt;
const
nmax = 20;
type
Vector = array [1..nmax] of integer;
procedure Enter(var A : Vector; n : integer);
var
i : integer;
begin
Writeln('Введите массив: ');
for i := 1 to n do
begin
Write('A[', i, '] = ');
Readln(A[i]);
end;
end;
procedure MaxMin(A : Vector; n : integer; var imin, imax : integer; var max, min : integer);
var
i : integer;
begin
max := A[1]; min := A[1];
imax := 1; imin := 1;
for i := 1 to n do
begin
if max < A[i] then begin max := A[i]; imax := i; end;
if min > A[i] then begin min := A[i]; imin := i; end;
end;
end;
procedure Count(A : Vector; var countp, countm : integer; n : integer);
var
i : integer;
begin
countp := 0; countm := 0;
for i := 1 to n do
begin
if A[i] > 0 then inc(countp);
if A[i] < 0 then inc(countm);
end;
end;
procedure FindFirst(A : Vector; n : integer; var first : integer);
var
i : integer;
begin
i := 1;
first := 0;
for i := 1 to n do
if A[i] > 0 then begin first := A[i]; break; end;
end;
var
A : Vector;
i, n, countp, countm, imax, max, imin, min : integer;
first : integer;
begin
Repeat
Write('Рамзер массива: ');
Readln(n);
until n in [1..nmax];
Enter(A, n);
MaxMin(A, n, imin, imax, max, min);
Writeln('Максимальный элемент: ', max, '[', imax, ']');
Writeln('Минимальный элемент: ', min, '[', imin, ']');
Count(A, countp, countm, n);
if countp < countm then
begin
FindFirst(A, n, first);
if first > 0 then
for i := 1 to n do
begin
if A[i] > 0 then A[i] := A[i] + first;
Write(A[i], ' ');
end else Writeln('Положительных элементов нет!');
end;
Readln;
end. |
|
0
|
(
Сообщение было отмечено Памирыч как решение
