-
-
2012
 |
Ņ.3
1. ⅅ...4
1.1. . .7
1.2. ..9
1.2.1. 9
1.2.2. 13
1.3. ..15
1.4. ...18
1.5. ⅅ19
2. ..21
2.1. ...21
2.2. ..22
2.3. .23
2.4. 23
2.5. .29
2.6. 3-廅37
3. 40
3.1. - .42
3.2. ...44
3.3. -ⅅ.49
3.4. 51
4. 셅53
4.1. .55
4.2. ..56
4.3. ...57
4.4. CMS-...57
4.5. 61
63
.64
- 充...65
"" , .
:
- ;
- ;
- ;
- ;
- ;
- .
: " , , ".
:
- () ;
- , ;
- ;
|
|
|
- , .
, . , . , , , . "" . .
, , .. ( ..) . , , , .
1.
.
: , , .
: .
. (), , , . .1. . , . ( ) . . , , .
1
| , . a 5,10,15 .., b=1,5a 2a |
| , , |
| - - , |
| : |
| , . |
| , |
| , , |
   
|
: , . . , (.2).
|
|
|
. , . .
, .3 , y=3x+4 x1,y1.
. 4
|
 . 3
|
, , . , , . . , , . , .4 n. i, 1 n c 1. f . , , . .
, , pr1, :
program pr1;
var a,b,result: integer;
begin
a:=2;
b:=3;
result:=a+b;
writeln(result);
end.
. , . , , , .
:
* ;
* ;
* .
:
program < >;
C program (), .. - .
< > . ( ) , , , , . () . , program var. , . , 63 . , , , result, . , . , , .
:
1) ;
2) ;
3) ;
4) ;
5) .
.
begin end , . . . , , .
|
|
|
, . pr1. .
, . var .
( ). writeln . .
, , , ., . , , , , .. , , - . Turbo Pascal , , .
Pascal .
, , , , . . . . .
:
)
TYPE
< > = ARRAY [ ] OF < >;
VAR
< >: < >;
)
VAR
< >: ARRAY [ ] OF < >;
, , . , . , Longint. -, .
:
CONST
N = 25; { }
TYPE
X = ARRAY [1.. 100] OF INTEGER;
Y = ARRAY [1.. N] OF REAL;
Z = RECORD
R, I: REAL
END;
VAR
M: X; { }
V1, V2: Y; { }
L1, L2: ARRAY [1.. 20 ] OF Z; { }
K: ARRAY [ BYTE ] OF CHAR; { }
R: ARRAY [ 1.. 5 ] OF STRING [25]; { }
T: ARRAY [-10.. 9] OF BYTE; { }
S: ARRAY [ BOOLEAN ] OF REAL; { }
F: ARRAY [ GREEN, RED, BLUE ] OF INTEGER; { -}
G: ARRAY [ 1.. N ] OF (MO, TU, WE, TH, FR, SA, SU);
{ }
- :
CONST
A: ARRAY [1.. 5] OF INTEGER = (1, 2, 3, 4, 5);
|
|
|
B: ARRAY [1.. 4] OF REAL = (1.1, 2.2, 3.3, 4.4);
, , . :
const n1=100; { }
type mas = array[1..n1] of integer;
var a:mas;
i, { }
n,s:integer;
begin
writeln (' :');
read (n);
{ }
randomize;{ }
for i:=1 to n do
a [i]:=random(10);
writeln (' ');
for i:=1 to n do
write (a[i]:5);
writeln;
s:=0; { }
for i:=1 to n do
s:=s+a[i];
writeln ('s=',s);
end.
, .
const n1=100; { pp }
type
mas = array[1..n1] of integer;
var
a:mas;
i, { }
n,s,
imax:integer;{ }
begin
writeln(' :');
read(n);
{ }
for i:=1 to n do
begin
read(a[i])
end;
s:=0;
imax:=1;{p, p }
for i:=1 to n do
begin
{ , }
if a[i]>0 then s:=s+a[i];
{ , }
if a[imax]<a[i] then imax:=i;
end;
writeln(' =',a[imax]);
a[imax]:=s;{ }
writeln('s=',s);
writeln('p :');
for i:=1 to n do
writeln (a[i]);
end.
. , . , .
:
)
FOR I: = 1 TO N DO READ (M [I]);
)
RANDOMIZE; { }
FOR I: = 1 TO N DO M [I]: = - 25 + RANDOM (D);
Random 0 D-1. i- -25. , -25 -25 + (D-1). , D 51, -25 +25.
, :
FOR I: = 1 TO N DO WRITELN (M [I]);
() FOR:
FOR I: = 1 TO N DO
FOR J: = 1 TO K DO
READ (M [I, J]);
WRITE WRITELN:
FOR I: = 1 TO N DO
FOR J: = 1 TO K DO
WRITELN (M [I, J])
, , .
. ().
:
)
TYPE
< > = ARRAY [ 1] OF ARRAY [ 2] OF < >;
< > = ARRAY [ 1, 2 ] OF < >;
, .
VAR
< >: < >;
)
VAR
< >: ARRAY [ 1, 2] OF < >;
, . , , .
:
CONST
N = 5;
M = 10;
TYPE
A = ARRAY [ 1.. N, 1.. M ] OF WORD;
B = ARRAY [ 1.. 10, 1.. 20 ] OF REAL;
VAR
C: ARRAY [ 1.. N, BOOLEAN ] OF -20.. 20;
D1, D2: A;
F1, F2: B;
- :
CONST
M: ARRAY [1.. 3, 1.. 2] OF INTEGER = ((1, 2), (3, 4), (5, 6));
, 3-, 4- n-. :
|
|
|
VAR
M: ARRAY [ 1.. 10, -10.. 9, CHAR ] OF BYTE;
N: ARRAY [ 1.. 5, 1.. 10, 1.. 15, 1.. 20 ] OF SHORTINT;
, . , 22: A[1,1], A[1,2], A[2,1], A[2,2].
, , . :
program pr21;
const n1=10; {o p }
m1=10; { }
type mas = array[1..n1,1..m1] of integer;
var a: mas;
i, { p }
j, { p }
n,s,m: integer;
begin
writeln(' p :');
read(n,m);
randomize;
for i:=1 to n do
for j:=1 to m do
a[i,j]:=random(10);
writeln(' ');
for i:=1 to n do
begin
for j:=1 to m do
write (a[i,j]:5);
writeln;
end;
s:=0;
for i:=1 to n do
for j:=1 to m do
s:=s+a[i,j];
writeln('s=',s);
end.
. . :
const n1=10; {o p }
m1=10; {o }
type
mas = array[1..n1,1..m1] of integer;{p p}
var
a:mas;
b:array[1..m1] of integer;{ }
i, { p p }
j, { p }
n,m,d:integer;
fl:boolean;
begin
writeln (' p :');
read(n,m);
for i:=1 to n do
for j:=1 to m do
begin
writeln(' ');
read(a[i,j]);
end;
writeln (' ');
for i:=1 to n do
begin
for j:=1 to m do
write (a[i,j]:5);
writeln;
end;
{pp p
}
for j:=1 to m do {pp }
begin
b[j]:=a[1,j];{p p }
for i:=2 to n do{pp }
if a[i,j]>b[j] then b[j]:=a[i,j];
end;
{ }
repeat
fl:=true;{ }
for j:=1 to m-1 do { }
if b[j]>b[j+1] then { }
begin
fl:=false;{ }
{ }
d:=b[j];
b[j]:=b[j+1];
b[j+1]:=d;
{ }
for i:=1 to n do
begin
d:=a[i,j];
a[i,j]:=a[i,j+1];
a[i,j+1]:=d;
end;
end;
until fl;{ , }
writeln(' ');
for i:=1 to n do
begin
for j:=1 to m do
write (a[i,j]:5);
writeln;
end;
end.
