.


:




:

































 

 

 

 





1. ( )

 

For i:=1 to N do

A[i]:=0;

 

For i:=1 to N do

For j:=1 to M do

B[i,j]:=0;

 

2.

 

Write ( N=);

ReadLn (N);

WriteLn ( );

For i:=1 to N do

Begin

Write (A[,i,]=);

ReadLn (A[i]);

End;

 

Write ( N, M);

ReadLn (N, M);

WriteLn ( );

For i:=1 to N do

For j:=1 to M do

Begin

Write (B[,i,,,j]=);

ReadLn (B[i,j]);

End;

 

3.

 

WriteLn ( :);

For i:=1 to N do

Write (A[i]:5);

WriteLn;

WriteLn ( :);

For i:=1 to N do

Begin

For j:=1 to M do

Write (B[i,j]:5);

WriteLn;

End;

 

4.

k:=0;

For i:=1 to N do

If A[i]=0 then k:=k+1;

k:=0;

For i:=1 to N do

For j:=1 to M do

If B[i,j]=0 then k:=k+1;

 

5.

min:=A[1];

i_min:=1;

For i:=1 to N do

If A[i]<min then

Begin

min:=A[i];

i_min:=i;

End;

min:=B[1,1];

i_min:=1;

j_min:=1;

For i:=1 to N do

For j:=1 to M do

If B[i,j]<min then

Begin

min:=B[i,j];

i_min:=i;

j_min:=j;

End;

 

6.

 

r:=A[1];

A[1]:=A[i_min];

A[i_min]:=r;

r:=B[1,1];

B[1,1]:=B[i_min,j_min];

B[i_min,j_min]:=r;

 

7.

sum:=0;

For i:=1 to N do

If A[i]>0 then sum:=sum+A[i];

 

sum:=0;

For i:=1 to N do

For j:=1 to M do

If B[i,j]>0 then sum:=sum+B[i,j];

 

8.

prod:=1;

For i:=1 to N do

If (A[i] mod 2) <> 0 Then

prod:=prod*A[i];

prod:=1;

For i:=1 to N do { Odd(X) }

For j:=1 to M do {, X }

If Odd(B[i,j]) Then

prod:=prod*B[i,j];

 

9. - ( ).

, i=j. i j=n-i+1. , , :

i=1,2,,n; j=1,2,,i i=1,2,,n; j=i,i+1,,n

i>=j i>=j

i=1,2,,n; j=1,2, n-i+1; i=1,2,,n;j=n-i+1,,n

n-i-j+1>=0 n-i-j+1<=0

sum:=0;

For i:=1 to n do

For j:=i to n do

If B[i,j]>=0 then sum:=sum+B[i,j];

 

10. .

Max:=B[1,1];

I_max:=1;

For i:=1 to n do

If B[i,i]> max then

Begin

Max:=B[i,i];

I_max:=i;

End;

Min:=B[1,n];

I_min:=1;

J_min:=n;

For i:=1 to n do

For j:=n-i+1 to n do

If B[i,j]< Min then

Begin

Min:=B[i,j];

I_min:=i;

J_min:=j;

End;

R:=B[I_max,I_max];

B[I_max,I_max]:=B[I_min,J_min];

B[I_min,J_min]:=R;

 

11. nxn. , i i- .

For i:=1 to n do

Begin

S:=0;

For j:=1 to n do

If B[i,j]>0 then S:=S+B[i,j];

A[i]:=S;

End;

 

12. nxn. , .

For j:=1 to n do

Begin

Max:=B[1,j];

I_max:=1;

For i:=1 to n do

If B[i,j]> Max then

Begin

Max:=B[i,j]

I_max:=i;

End;

For i:=1 to n do

If i_max<>i then B[i,j]:=0;

End;

 

: A(n), . , , , .

 

Program Example_Vect;

Uses Crt;

Const

N_max=10;

Var

N,i,max,i_max,min,i_min,r:integer;

A:array [1..N_max] of integer;

Begin

Clrscr;

Write( N (<,N_max,)=);

ReadLn (N);

WriteLn ( );

For i:=1 to N do { }

Begin

Write (A[,i,]=);

ReadLn (A[i]);

End;

WriteLn ( :);

For i:=1 to N do { }

Write (A[i]:5);

WriteLn;

min:=A[1]; { }

i_min:=1; { }

For i:=1 to N do

If A[i]<min then

Begin

min:=A[i];

i_min:=i;

End;

max:=A[1];

i_max:=1; { }

For i:=1 to N do { }

If A[i]>max then

Begin

max:=A[i];

i_max:=i;

End;

WriteLn ( A[,i_min,]=,min);

WriteLn ( A[,i_max,]=,max);

r:=A[i_min]; {}

A[i_min]:=A[i_max];

A[i_max]:=r;

WriteLn ( :);

For i:=1 to N do { }

Write (A[i]:5);

WriteLn;

End.

1. .

2. ( ).

3. .

4. , . , , - , .


6.

:

, . , .

 

   
  [MxN]. ( () ) .
  [MxN] A. ( () ) .
  ( ). . ( () ) .
  2 [MxN] [NxK]. ( () ) .
  33. , . .
  [MxN] A. ( () ) .

 

 

   
  . . ( () ) .
  [MxN], . ( () ) .
  [MxN], , A. ( () ) .
  . . ( () ) .
  [MxN], . ( () ) .
  j k [MxN]. ( () ) .
  [MxN] A . ( () ) .
  [MxN]. ( () ) .
  [MxN]. ( () ) .
  [MxN] A. ( () ) .
  [MxN]. ( () ) .

 

 

   
  [MxN] A. ( () ) .
  ( ). . ( () ) .
  2 [MxN] [NxK]. ( () ) .
  33. , . .
  [MxN] A. ( () ) .
  . . ( () ) .
  [MxN], . ( () ) .
  . . ( () ) .
  [MxN], . ( () ) .
  [MxN], , A. ( () ) .
  . . ( () ) .

 

 

   
  [MxN], . ( () ) .
  j k [MxN]. ( () ) .
  [MxN] A . ( () ) .
  [MxN], . ( () ) .
  j k [MxN]. ( () ) .
  [MxN] A . ( () ) .
  [MxN]. ( () )

 

 

1. Debug Turbo?

2. Debug?

3. , .

4. ?

5. ?

6. .





:


: 2016-12-04; !; : 588 |


:

:

, .
==> ...

818 - | 659 -


© 2015-2024 lektsii.org - -

: 0.031 .