, , :
- , ;
- ;
- () , , , integer;
- x: array[1..5] of integer: 5 x[1], x[2], x[3], x[4], x[5] integer.
1. x[5].
:
| 1: . Program Summa; var x:array[1..5] of real; s:real; begin Writeln(' x '); Read(x[1], x[2], x[3], x[4], x[5]); { } S:= x[1]+ x[2]+ x[3]+ x[4]+ x[5]; write('S= ', s); Readln; end. | 2: . . Program Summa; var x:array[1..5] of real; s:real; i: integer; begin Writeln(' x '); for i:=1 to 5 do Read(x[i]); S:=0; for i:=1 to 6 do S:= S+ x[i]; write('S= ', s); Readln; end. |
2. Z.
:
| x | z | ||
| 1,2,3,4,5,6 | 1,4,3,8,5,12 | ||
| -1,-2,-3,1,3,2 | -1,0,-3,1,3,0 |
:
Program Chet_Index;
Const n=6;
var
x: array[1..n] of real;
i: integer;
z: real;
begin
Writeln(' x ');
for i:=1 to n do { }
Read(x[i]); { }
Writeln(' z ');
Readln(z)
for i:=1 to n do
begin
if i mod 2=0 then
x[i]:= x[i]*z;
end;
for i:=1 to n do { }
write(x[i], ' '); { }
Readln;
end.
: , .
3. .
:
| x | ||
| 1,2,3,4,5,6 | 6,2,3,4,5,1 | |
| -1,-2,-3,1,3,2 | -1,-2,3,1,-3,2 |
:
Program change_max_min;
Const n=6;
var
x:array[1..N] of real;
i:integer;
max, min, Index_min, Index_max:real;
{ }
begin
Writeln(' x ');
for i:=1 to n do
Read(x[i]);
max:=x[1];
min:=x[1];
Index_max:=1;
Index_min:=1;
for i:=2 to n do
begin
if x[i]> max then
begin
max:=x[i]; { }
Index_max:=i; { }
end;
if x[i]< min then
begin
min:=x[i];
Index_min:=i;
end;
end;
x[Index_min]:=max;
x[Index_max]:=min;
for i:=1 to n do
write(x[i], ' ');
Readln;
end.
4. , m[k] m[n+1]=m[n]+1, n=1,2,k.
|
|
|
:
| x | ||
| 1,2,3,4,5,6 | . | |
| 3,4,5,5,6,7 | . |
:
Program Zadacha_N3;
var
x:array[1..6] of real;
i:integer;
Otvet boolean;
begin
Writeln(' x ');
for i:=1 to 6 do
Read(x[i]);
Otvet:=true;
i:=1;
repeat
if x[i+1]<>x[i]+1 then
Otvet:=false;
i:=i+1;
until (i=5) or (Otvet=false);
if otvet then
write(' . ')
else
write(' . ')
Readln;
end.
1. .
2. , .
3. , , , .
4. , , .
5. .
6. X(n) Y(n) .
7. .
8. . 3 X 3.
9. :
) ;
) ;
) , .
10. , .
11. , .
12. .
13. , , .
14. A[i]=A[i-1]+A[i-2]] i=2,3,..n.
15. :
A[i]=A[1]+A[2]+...+A[k] k < i.
7.
: .
:
¾ , ;
¾ , ;
¾ , .
:
1. , , .
2. : [4: 7.4 7.6], [7: 17, 18].
3. .
4. .
: 3 4 1 2.
1. x[n,m].
:
| m | ||
| 1 2 3 2 3 4 2 2 2 | ||
| 3 0 -3 -2 -3 -4 0 0 0 | -9 |
:
|
|
|
Program Summa_Columns_of_matrix;
Const
n=3; m=3;
var
x:array[1..n,1..m] of integer;
i, j, s: integer;
begin
Writeln(' x[3X3] ');
for i:=1 to 3 do
for j:=1 to 3 do
read(x[i,j]);
| s:=x[1,1]+ x[1,2]+ x[1,3]; writeln(S); s:=x[2,1]+ x[2,2]+ x[2,3]; writeln(S); s:=x[3,1]+ x[3,2]+ x[3,3]; writeln(S); readln; end. | S:=0; for j:=1 to m do s:=s+x[1,j]; writeln(S); S:=0; for j:=1 to m do s:=s+x[2,j]; writeln(S); S:=0; for j:=1 to m do s:=s+x[3,j]; writeln(S); readln; end. |
for i:=1 to n do
begin
s:=0;
for j:=1 to m do
s:=s+x[i,j];
writeln(S);
end;
readln;
end.
1- x n m .
2- , .
2. x[n,n].
:
| x[n,n]. | ||
| 2 2 2 2 2 2 2 2 2 | 4 2 4 2 4 2 4 2 4 |
:
Program Kvadrat_Diagonals;
const
n=3;
var
x:array[1..n,1..n] of integer;
i, j, centr: integer;
begin
Writeln(' x[3X3] ');
for i:=1 to n do
for j:=1 to n do
read(m[i,j]);
centr:=n div 2 + n mod 2; { }
| x[1,1];=x[1,1]* x[1,1]; x[2,2];=x[2,2]* x[2,2]; x[3,3];=x[3,3]* x[3,3]; x[1,3];=x[1,3]* x[1,3]; x[3,1];=x[3,1]* x[3,1]; | for i:=1 to n do x[i,i]:=x[i,i] * x[i,i]; for i:=1 to n do begin if i<> centr then m[i, n+1-i]:= sqr (m[i,n+1-i]); end; |
for i:=1 to n do
begin
m[i,i]:= sqr(m[i,i]);
if i<> centr then
m[I, n+1-i]:=sqr(m[i,n+1-i]);
end;
for i:=1 to n do { }
begin
for j:=1 to n do
Write(m[i,j]:3);
writeln;
end;
readln;
readln;
end.
3. .
:
| 1 2 3 7 3 4 2 2 0 | 1 2 3 0 3 4 2 2 7 | |
| 3 0 -3 -2 -3 -4 0 0 0 | -4 0 -3 -2 -3 3 0 0 0 |
:
Program change_max_min;
Const
n=3; m=3;
var
x:array[1..n,1..m] of integer;
i, j, t, i_max, j_max, i_min, j_min: integer;
begin
Writeln(' m ');
for i:=1 to n do
for j:=1 to m do
read(x[i,j]);
i_max:=1;
j_max:=1;
i_min:=1;
j_min:=1;
for i:=1 to 3 do { }
for j:=1 to 3 do ( }
begin
if m[i,j] > m[i_max,j_max] then
begin
i_max:=i;
j_max:=j;
end;
if m[i,j] < m[i_min,j_min] then
begin
i_min:=i;
j_min:=j;
end;
end;
t:=m[i_max,j_max]; { max min}
m[i_max,j_max]:=m[i_min,j_min];
m[i_min,j_min]:=t;
for i:=1 to 3 do { }
begin
for j:=1 to 3 do
Write(m[i,j]:3);
writeln;
end;
readln;
end.
1. A(n,m).
2. .
3. .
4. .
5. A Q.
6. Z.
7. .
8. , .
9. .
|
|
|
10. , .
11. .
12. A[n,m], B[n,m], C[n,m] X , x[i,j]=max(a[i,j],b[i,j],c[i,j].
13. N.
14. [i,j], a[i,j] b[i,j].
15. - .
16. .
17. .
18. .
19. , .
8.
: .
:
¾ String;
¾ ;
¾ .
:
1. , , .
2. .
3. : [7: 14], [10: 4.3].
4. .
5. .
: 4 5 1 3.
