. .
, .
()
. - ( ), . () () , . .
, , , , . . , , .
:
10..21
-99..99
'A'..'Z'
, , , .
, , .
.
1. ?
2. ( )?
) - 10..10; ) 100..-1; ) ..10; ) ..Y; ) 1..D; ) W..C.
. . , ,
, , . ( ) . , (). , , . .
:
1) ;
2) ;
3) ;
4) ;
5) .
. , .
:
1) , ;
2) ;
3) , , (1 - , 2 ..),
4) ( - ) ;
|
|
|
5) , , .
, .
( ):
= array[ ] of
- ;
- () , ;
- .
, longint - longint.
1. mas, 10 integer:
Type
mas = array[1..10] of integer;
( ) , .
:
:array[ ] of ;
.
2 :
Var
a,b,c:array[1..10] of real; { a,b,c 10}
int_1: array[1..20] of integer; { int_1 20}
int_2: array[1..20] of integer;
Matr:array[1..n,1..n] of real; { Matr, n }
- (a,b,c 2), . - , , - int_1 int_2 2.
( ) .
, . .
, of , - , . , :
Type
massiv = array[1..10] of array[1..20] of real;
2:
Type
massiv = array[1..10, 1..2] of real;
() , ( , 1). , , , . , , . .
3 , 2:
a[2] b[10] int_1[5] int_2[20] Matr[2,3]
4 , 2:
|
|
|
a[12] { a 1 10, 12 }
b[-1] { b }
. , , .
, , .
5. , . :
const n = 4;
type mas = array[1..n] of integer;
var a: mas; i: integer;
Begin
writeln('Vvedite elementi massiva');
for i:=1 to n do begin write(' a[',i,']=');readln(a[i]); end;
writeln('Vivod elementov massiva:');
for i:=1 to n do writeln(' a[',i,']=',a[i]:5);
End.
, ( ) ( ).
.
1. ?
2. ?
3. .
4. ()?
5. ?
6. , ?
7. ?
8. -?
9. -, .
10. ?
11. ?
. , .
( ) .
1. a:array[1..5, 1..5]:
var a:array[1..5,1..5] of real;
i,j:integer;
for i:=1 to 5 do
for j:=1 to 5 do a[i,j]:=0;
, : , .
, FillChar(var Vr; NBytes: Word; Chr: Byte). Vr NBytes Chr.
2. ch:array[1..20]:
FillChar(ch, 20, 0);
, , .
3. a[1..6], , : 1.2, 4.5, -2.4, 5.7, -8.0, 10.5:
Type
array_6 = array[1..6] of real;
const a:array_6 = (1.2, 4.5, -2.4, 5.7, -8.0, 10.5);
.
1. ?
2. ?
3. ?
()
, . ( ), .
|
|
|
1 2. 5. . .
. , - ( ), , .
1. ( 1000) A[1..10]. . .
. NMax, MaxMod. , ( 1), . A[i] , , (abs(A[i])>abs(MaxMod)) ((i mod 2)=1).
var a: array[1..10] of integer; { }
i,MaxMod,NMax: integer; { i, MaxMod NMax }
Begin
writeln('Vvedite elementi massiva A');
for i:=1 to 10 do begin write(' A[',i,']=');readln(A[i]);end; { }
writeln(' Entert massiv A:');
for i:=1 to 10 do write(' A[',i,']=',A[i]:4); writeln; { }
MaxMod:=A[1];NMax:=1; { }
for i:=2 to 10 do if (abs(A[i])>abs(MaxMod))and((i mod 2)=1) { i }
then begin MaxMod:=A[i]; NMax:=i end; { }
writeln(' Rezult: NMax=',NMax,' MaxMod=', MaxMod); { }
End.
, , , a[1..n]. t.
1. . , -.
, a n k , b. , , :
n:=n+1; for i=n downto k+2 do a[i]:=a[i-1]; a[k+1]:=b;
a n k:
n:=n-1; for i=k to n do a[i]:=a[i+1];
2. . : a[1]a[2]; a[2]a[3]; a[n-1]a[n]; a[n]a[1].
, , ( a[n]):
t:=a[n]; for i=n downto 2 do a[i]:=a[i-1]; a[1]:=t;
C (a[2]a[1]; a[3]a[2]; a[n]a[n-1]; a[1]a[n]) :
|
|
|
t:=a[1]; for i=1 to n-1 do a[i]:=a[i+1]; a[n]:=t;
3. . a[1..n] : m=(a[1]+a[2]++a[n])/n. S m :
S:=0; for i=1 to n do S:=S+a[i]; m:=S/n;
, .
2. A[1..10] { 81,-54,-72,295,-85,10,44,58,-32,59 }. A 5, B , c . A[1..10], B .
. A , . j k, . B[1..5] [1..5] , A .
type array_10 = array[1..10] of integer; { A}
const a:array_10 = (81, -54, -72, 295, -85, 10, 44, 58, -32, 59);
var b,c: array[1..5] of integer; { B,C}
i,j,k: integer; { i,j,k }
Begin
writeln(' Entert massiv a:');
for i:=1 to 10 do write(' a[',i,']=',a[i]:4); writeln; { a}
j:=0;k:=0; { B }
for i:=1 to 10 do if (i mod 2)=1 { i }
then begin j:=j+1;b[j]:=a[i] end { B}
else begin k:=k+1;c[k]:=a[i] end; { }
writeln(' Rezult massiv B:');
for i:=1 to 5 do write(' b[',i,']=',b[i]:4); writeln; { B}
writeln(' Rezult massiv C:');
for i:=1 to 5 do write(' c[',i,']=',c[i]:4); { C}
End.
3. . , , . ( ) ( , . - bubble sort)). , , . , . , . A Num_Array integer count. ( ) key. A[i] [i-1] con: A[i]con; [i-1]A[i]; con[i-1]:
{ }
procedure Bubble_sort(var A:Num_Array; count:integer);
var con,i: integer; key: boolean;
Begin
key:= true; { }
while key do { }
Begin
key:= false; { , }
for i:= 2 to count do { }
if A[i]<A[i-1] then { }
begin { }
key:= true; { - }
con:= A[i-1]; { A[i-1],A[i],con }
A[i-1]:= A[i];
A[i]:= con;
end; { }
end; { while }
end; { }
4. ( 1000) A[1..5] B[1..5]. : A[i] B[i] A[i], B[i]. A[1..5] B[1..5], .
|
|
|
. A[i] B[i] con: A[i] con; B[i] A[i]; con B[i]. A B 1, 2.
var a,b: array[1..5] of integer; { }
i,con: integer; { i con }
Begin
// A B - 1
for i:=1 to 5 do
if A[i]<=B[i] then { }
begin con:=A[i]; A[i]:= B[i]; B[i]:= con end;
// A B - 2
End.
.
1. ?
2. ?
3. ? .
4. ?
5. ?
6. ?
.
1. , :
) A[1..10],
) ,
) N S,
) N S .
2. , :
) A[1..12],
) ,
) A , A, ,
) .
