.


:




:

































 

 

 

 


ө ғ қ өң




ө өңң . ө ә ұ

ө өң ү ү қ ө :

  • ү өң;
  • Қ ғ өң;
  • ғ қ өң.

ң әқ ққ.

ү өң

7.1-
( ө ә - ңғ қ қ ) for i=1 to nfor j=1 to minput x(i,j)next jnext i for i:=1 to n dofor j:=1 to m do readln (x[i,j]);
ғ for i=1 to nfor j=1 to mprint x(i,j);" ";next jprint next i for i:=1 to n dobeginfor j:=1 to m dowrite (x[i,j], ' ');writeln;end;
Қ, ө p=1for i=1 to nfor j=1 to ms=s+x(i,j)p=p*x(i,j)next jnext i s:=0; p:=1;for i:=1 to n dofor j:=1 to m dobegins:=s+x[i,j];p:=p*x[i,j];end;
() max=x(1,1)min=x(1,1)for i=1 to nfor j=1 to mif x(i,j)>max then max=x(i,j)if x(i,j)<min then min=x(i,j)next j,i max:=x[1,1];min:=x[1,1];for i:=1 to n dofor j:=1 to m dobeginif x[i,j]>max then max:=x[i,j];if x[i,j]<min then min:=x[i,j];end
ң () for i=1 to nfor j=1 to mif {} then {}next jnext i for i:=1 to n dofor j:=1 to m doif {} then { }

ң қ өң :

7.2-
Ә қғ ң қ for i=1 to nfor j=1 to ms(i)=s(i)+x(i,j)next jnext irem-----------for i=1 to nprint s(i);" ";next for i:=1 to n dos[i]:=0;for i:=1 to n dofor j:=1 to m dos[i]:=s[i]+x[i,j];for i:=1 to n dowrite (s[i]);
Ә қғ ң ө for i=1 to np(i)=1nextrem---------for i=1 to nfor j=1 to mp(i)=p(i)*x(i,j)next jnext ifor i=1 to nprint p(i);" ";next for i:=1 to n dop[i]:=1;for i:=1 to n dofor j:=1 to m dop[i]:=p[i]*x[i,j];for i:=1 to n dowrite (p[i]);
Ә қғ () for i= 1 to nmax(i)=x(i,1)min(i)=x(i,1)nextfor i=1 to nfor j=1 to mif x(i,j)>max(i) then max(i)=x(i,j)if x(i,j)<min(i) then min(i)=x(i,j)next j,ifor i=1 to nprint max(i);" ";;nextprint for i=1 to nprint min(i);" ";;next for i:= 1 to n dobeginmax[i]:=x[i,1];min[i]:=x[i,1]; end;for i:=1 to n dofor j:=1 to m dobeginif x[i,j]>max[i] then max[i]:=x[i,j];if x[i,j]<min[i] then min[i]:=x[i,j]; end;for i:=1 to n dowrite (max[i]);writeln;for i:=1 to n dowrite (min[i]);
Ә қғ ң () for i=1 to nfor j=1 to mif {} then {rez(i)=}next jnext ifor i=1 to nprint rez(i);" ";next for i:= 1 to n dobeginrez[i]:=0; end;for i:=1 to n dofor j:=1 to m doif {} then < rez[i]:= >;for i:=1 to n dowrite (rez[i]);

ң ғ өң :

7.3-
Ә ғғ ң қ for j=1 to mfor i=1 to ns(j)=s(j)+x(i,j)next inext jfor j=1 to mprint s(j)next for j:=1 to m do s[j]:=0;for j:=1 to m dofor i:=1 to n dos[j]:=s[j]+x[i,j];for j:=1 to m do write (s[j]);
Ә ғғ ң ө for j=1 to mp(j)=1nextfor j=1 to mfor i=1 to np(j)=p(j)*x(i,j)next inext jfor j=1 to mprint p(j)next for j:=1 to m do p[j]:=1;for j:=1 to m dofor i:=1 to n dop[j]:=p[j]*x[i,j];for j:=1 to m do write (p[j]);
Ә ғғ () for j= 1 to mmax(j)=x(i,1)nextfor j=1 to mfor i=1 to nif x(i,j)>max(j) then max(j)=x(i,j)next i,jfor j=1 to mprint max(j);" ";next printfor j=1 to mprint min(j);" ";next for j:= 1 to m dobeginmax[j]:=x[i,1];min[j]:=x[i,1]; end;for j:=1 to m dofor i:=1 to n dobeginif x[i,j]>max[j] then max[j]:=x[i,j]if x[i,j]<min[j] then min[j]:=x[i,j] end;for j:=1 to m dowrite (max[j]);writeln;for j:=1 to m dowrite (min[j]);
Ә ғғ ң () for j=1 to mfor i=1 to nif {.} then {rez(i)=}next inext jfor j=1 to mprint rez(j);" ";next for j:= 1 to m dorez[j]:=0;for j:=1 to m dofor i:=1 to n doif {.} then {rez[i]:=};for j:=1 to m dowrite (rez[j]);

ө ғ қ өң

ө қ ғ , . ғ ғ қ өң ү . Қ ң 1-қ ұғ 1- ә -ң қ ( қң ө ө, ғ ө ).

7.1- ң

. ң қ :

7.4-
ғ қ for i=1 to ns=s+x(i,i)next i s:=0;for i:=1 to n dos:=s+x[i,i];
ғ қ қ for i=1 to nfor j=1 to nif i<j then s=s+x(i,j)next j, i s:=0;for i:=1 to n dofor j:=1 to n doif i<j then s:=s+x[i,j];
ө қ қ for i=1 to nfor j=1 to nif i>j then s=s+x(i,j)next j i s:=0;for i:=1 to n dofor j:=1 to n doif i>j then s:=s+x[i,j];

Қ . ң қ қ :

7.5-
Қ ғ қ for i=1 to ns=s+x(i, n-i+1)next i s:=0;for i:=1 to n dos:=s+x[i, n-i+1];
Қ ғ қ қ for i=1 to nfor j=1 to nif (i<n-j+1) then s=s+x(i,j)next j, i s:=0;for i:=1 to n dofor j:=1 to n doif (i<n-j+1) then s:=s+x[i,j];
Қ ө қ қ for i=1 to nfor j=1 to nif (i>n-j+1) then s=s+x(i,j)next j, i s:=0;for i:=1 to n dofor j:=1 to n doif (i>n-j+1) then s:=s+x[i,j];

ғ қ өң ( )

ң қ өңң ғ . Ө, ң қ қ. қ қ ң ә ғ . ү ғ қ ң қ ңғ әң қ ң ә ә .

ә қ өң - .

1-. ң 1- :

7.6-
ө ғ Қ ө Қ ғ
100000000 110000000 111000000 111100000 111110000 111111000 111111100 111111110 011111111 001111111 000111111 000011111 000001111 000000111 000000011 000000001 111111110 111111100 111111000 111110000 111100000 111000000 110000000 100000000 000000001 000000011 000000111 000001111 000011111 000111111 001111111 011111111
-: for i=1 to nfor j=1 to ix(i,j)=1next j, i -: for i:=1 to n dofor j:=1 to i dox[i,j]:=1; -: for i=1 to nfor j=i to nx(i,j)=1next j, i -: for i:=1 to n dofor j:=i to n dox[i,j]:=1; -: for i=1 to nfor j=1 to (n-i+1)x(i,j)=1next j, i -: for i:=1 to n dofor j:=1 to (n-i+1) dox[i,j]:=1; -: for i=1 to nfor j=(n-i+1) to nx(i,j)=1next j, i -: for i:=1 to n dofor j:=(n-i+1) to n dox[i,j]:=1;




:


: 2017-03-18; !; : 774 |


:

:

, .
==> ...

1591 - | 1386 -


© 2015-2024 lektsii.org - -

: 0.008 .