.


:




:

































 

 

 

 


program prim_deistvi_nad_massivami;

5

 

 

8

1:

8. . .

 

: random.

, , 1

1

n real
i real
sum real
a integer

1.3


 

 

. 1

Program summ;

Const

n=10;

Type

tarray=array[1..n] of integer;

var i, sum: integer;

a: tarray;

Begin

sum:=0;

writeln (' ');

for i:=1 to n do begin

a [i]:=random(100);

sum:=sum+a[i];

write (a[i]:3,' ');

end;

writeln (' =',sum);

readln;

End.

, . .

1:

24 56 32 47 32 54 2 7 32 89 43

= 418

2:

8. , k1- k2-. k1 k2, , .

 

: random k1 k2 .

, , 2.

2

n real
i real
k1, k2 real
a integer

1.3

. 2

program udalenie;

const

n=10;

type

tarray=array[1..n] of integer;

var i, k1, k2: integer; a: tarray;

begin

writeln ('udalenie elementov massiva');

writeln ('ishodnui massiv');

for i:=1 to n do begin

a [i]:=random(100); write (a[i]:3,' ');

end;

writeln; writeln ('vvedite nomer s kotorogo nachat udalenie:'); readln (k1);

writeln ('vvedite nomer do kotorogo delat udalenie:'); readln (k2);

if (k1>k2) or (k2>n) then writeln ('vvod ne korrektnuy');

begin for i:=1 to k1 do write (a[i]:3,' ');

for i:=k2 to n do write (a[i]:3,' ');

readln; end;

end.

1:

udalenie elementov massiva

ishodnui massiv

24 56 32 47 32 54 2 7 32 89 43

vvedite nomer s kotorogo nachat udalenie: 4

vvedite nomer do kotorogo delat udalenie: 7

24 56 32 47 2 7 32 89 43

3:

8. .

: k .

, , 3.

3

n real
i real
k real
b real ,
a integer

 

 

1.3

 

 
 

 

 


. 3

Program vstavka;

Const

n=15;

var i, k, b: integer;

a:array [1..n+1] of integer;

Begin

randomize;

writeln ('vstavka elementa v massiv');

writeln ('zapolnenie massiva');

for i:=1 to n do

begin

a[i]:=random (25+25+1)-25;

write (a[i]:3,' ');

end;

for i:=n downto 1 do

begin

if (a[i]<0) then

k:=i;

end;

writeln;

writeln ('vvedite chislo, kotoroe nushno vstavit'); readln (b);

for i:=n+1 downto k+1 do

a[i]:=a[i-1];

a[k+1]:=b;

for i:=1 to n+1 do

write (a[i]:3,' ');

readln;

End.

7, , . .

1:

vstavka elementa v massiv

zapolnenie massiva

13 -5 6 7 13 25 12 -8 -3 -8 9 14 23 -21 6

vvedite chislo, kotoroe nushno vstavit 7

13 -5 7 6 7 13 25 12 -8 -3 -8 9 14 23 -21 6

4:

8. . i, :

) [i] < B[i]

) A[i] = B[i];

) A[i] > B[i]

: random.

, , 4.

4

n, m integer
a, b integer
i integer
g integer [i] < B[i]
e integer A[i] = B[i];
f integer A[i] > B[i]

 

1.3

 


. 4

 

Program sravnenie;

Const

n=15; m=15;

var i, j, g, e, f: integer;

a:array [1..n] of integer;

b:array [1..m] of integer;

Begin

randomize;

g:=0; e:=0; f:=0;

writeln ('Sravnenie massivov');

writeln ('Perviy massiv');

for i:=1 to n do begin

a[i]:=random (10);

write (a[i]:3,' ');

end;

writeln; writeln ('Vtoroy massiv');

for i:=1 to m do begin

b[i]:=random (10);

write (b[i]:3,' ');

end;

for i:=1 to n do begin

if a[i]<b[i] then begin g:=g+1; end

else

if a[i]=b[i] then begin e:=e+1; end

else

if a[i]>b[i] then begin f:=f+1; end;

end;

writeln;

writeln ('Kjlichestvo i, dlya kotoruh A[i]<B[i] = ',g);

writeln ('Kjlichestvo i, dlya kotoruh A[i]=B[i] = ',e);

writeln ('Kjlichestvo i, dlya kotoruh A[i]>B[i] = ',f);

readln;

end.

2 , . .

1:

Sravnenie massivov

Perviy massiv

4 6 2 4 7 6 3 8 3 0 2 5 7 2 4

Vtoroy massiv

7 6 7 7 6 3 8 3 3 0 2 7 2 4 0

Kjlichestvo i, dlya kotoruh A[i]<B[i] = 6

Kjlichestvo i, dlya kotoruh A[i]=B[i] = 4

Kjlichestvo i, dlya kotoruh A[i]>B[i] = 5

 

 

5:

8. X(N) 0, 1 2. , , , , ( ).

: .

, , 5.

5

n integer
a integer
i integer 1

1.3

 

. 5

Program perestanovka;

Const

n=15;

var i: integer;

a:array [1..n] of integer;

Begin

randomize;

writeln ('Perestanovka massiva');

writeln ('Ishodniy massiv');

for i:=1 to n do

begin

a[i]:=random (3);

write (a[i]:3,' ');

end;

writeln;

writeln ('Noviy massiv');

for i:=1 to n do begin

if a[i]=1 then begin write (a[i]:3,' '); end;

end;

for i:=1 to n do begin

if a[i]=2 then begin write (a[i]:3,' '); end;

end;

for i:=1 to n do begin

if a[i]=0 then begin write (a[i]:3,' '); end;

end;

writeln;

writeln;

writeln;

readln;

End.

0,1 2, . .

1:

Perestanovka massiva

Ishodniy massiv

2 1 0 2 2 2 0 1 1 0 2 0 1 2 0

Noviy massiv

1 1 1 1 2 2 2 2 2 2 0 0 0 0 0

 

6:

8. . , 1 .

: random.

 

, , 6.

6

n integer
a, b integer
i integer 1
j integer 2
h integer

 

1.3

 
 

 


. 4

 

program prim_deistvi_nad_massivami;

Const

n=10;

var i, j, h: integer;

a: array [1..n] of integer;

b: array [1..n] of integer;

Begin

h:=0;

randomize;

writeln (' ');

writeln (' ');

for i:=1 to n do begin

a [i]:=random(10);

write (a[i]:3,' ');

end;

writeln;

for i:=1 to n do begin

b [i]:=a[i];

end;

writeln;

writeln ('Novii massiv');

for i:=1 to n do begin

h:=0;

for j:=1 to n do

if a[i]=b[j] then

h:=h+1;

if h<2 then write (a[i]:3,' ');

end;

readln;

End.

, . .

1:

10 3 5 4 6 4 2 7 5 3

Novii massiv

10 6 2 7



<== | ==>
| Program dvumernie_massivi;
:


: 2016-10-22; !; : 250 |


:

:

: , , , , .
==> ...

756 - | 694 -


© 2015-2024 lektsii.org - -

: 0.063 .