! , .
, , :
case n of
1:........
2:
Begin
if not Flag then
Writeln (' , 1');
Else
Begin
if X > 0 then
Y:= 1 / X
Else
Y:= X * X;
Writeln(' X = ', X:7:2, ' Y = ', Y:7:2);
End;
end;
3: Exit;
End;
. , ( 2 ). , BEGIN END, . , BEGIN..END, .
2.8.
1) A, B, C , .
2) , , . .
3) A, B, C. , .
4) A B , .
5) =2+b+.
6) , R A.
7) , S N- ( ).
8) , .
9) , , : , , .
10) , : 1 /, , ( ).
11) , , : , 1 .
12) , ( , ), .
13) , , : ; , .
14) , , : , .
|
|
15) , , : ( ), .
16) , , : , .
17) , : ; .
18) y=ax2+bx+c.
19) , .
20) A, B, C , .
2.9. (. 1.11)
2.10.
1) , IF.
2) .
3) CASE IF?
4) CASE?
5) .
6) ?
7) ?
8) ?
9) ?
10) Watch?
11) Watch?
3.
3.1.
() Pascal.
3.2.
FOR, :
) ( N , N ..);
) .
3.3.
:
, ;
( ); ;
;
, ;
3.4.
1) (. 3.8).
2) FOR Pascal (. 3.5).
3) ( N , N ..) .
4) (ARRAY) Pascal (. 3.6).
5) .
6) (. 3.7).
7) (. 3.10).
8) (. . 1.11)
3.5. FOR
, ( ). Pascal FOR, 2 :
1) for I:= N1 to N2 do < >;
2) for I:= N1 downto N2 do < >;
FOR . () N1 N2. I ( ) N1. I N2 I ( FOR) I N2 ( FOR), , .. ( BEGIN..END). , , FOR, I ( , , ), N2 , .
|
|
FOR. Num J , .
var Num, J: Integer; begin Num:= 3; { 1 5} for J:= 1 to 5 do begin { } Writeln(J, ') ', Num, '*', J, '=', Num * J); { } Num:= Num * J; end; end. | : 1) 3*1=3 2) 3*2=6 3) 6*3=18 4) 18*4=72 5) 72*5=360 |
var Num, J, K: Integer; begin Num:= 7; K:= 1; { } { 9 6} for J:= 9 downto 6 do begin { } Writeln(K, ') ', Num, '*', J, '=', Num * J); { } Num:= Num * J; K:= K + 1; { } end; end. | : 1) 7*9=63 2) 63*8=504 3) 504*7=3528 4)3528*6=21168 |
FOR downto, J ( ) 9 6, K. , J 1 5, .
FOR () ():
const n = 5; { } var I: Integer; Res, X: Real; begin X:= 10; { } Res:= 0; { Res} for I:= 1 to n do Res:= Res + I * (X * X); Writeln('Res = ', Res:8:2); end. | const n = 4; { } var I: Integer; Res, X: Real; begin X:= 15; { } Res:= 1; { } for I:= 1 to n do Res:= Res * (X + I * I * I); Writeln('Res = ', Res:8:2); end. |
FOR :
( ), N1 N2 . REAL . INTEGER;
;
; , .. ;
, , .
Cos. 2 FOR: ( I) ( J):
program Cosinus; const Pi = 3.14159; { Pi} { } MaxGradus = 90; var I, J: Integer; Rad, Value: Real; begin { I ( -90 +90)} for I:= -MaxGradus to MaxGradus do begin { , 5} if I mod 5 = 0 then begin { } Rad:= Pi * I / 180; { . Value} { 0 1} Value:= Cos(Rad); { () ( J)} { 1 20 } {Round } for J:= 1 to Round(Value * 20) do Write(' '); { *} Writeln('*'); end; end; Readln; { ENTER} end. |
|
|
:
1) I , 90 +90. , Cos 0 1.
2) mod . if I mod 5 = 0 then , I 5 (.. -90, -85, -80,, -10, -50, 5, 10, 85, 90). , * . , . 180 * 37 .
3) Cos , , , 1 +1. Cos : Rad:= Pi * I / 180.
4) FOR J. , .. . . , 20 , .. Value 0 1.
5) * Writeln.
6) Readln, , , Enter. . Alt+F5 .
, . FOR , , . .
. Break. , , Continue. Continue, , , Continue. Break, , .
3.1 , .
3.1 for
Pascal . , :
{ X N}
program Stepen;
Var
X, Res: Real;
N, I: Integer;
Begin
{*** ***}
Write(' X N:');
Readln(X, N);
{*** ***}
Res:= 1; { Res}
for I:= 1 to N do { }
Res:= Res * X;
{*** ***}
Writeln('X^N=', Res:5:2);
end.
, .
, : Y:= X * X Y:= X * X * X.
1 , :
|
|
if Odd(N) then { ... }
Y:= 1
else { ( )... }
Y:= 1;
Odd , True, , False.
3.6.
, . . , .. , . > 2 .
:
Var
< > = array [<>] of < >;
< > ( );
<> , :
- [1..10] (), 1, 10 ( 10 );
- [0..4] , 0, 4 ( 5 );
- [1..5, 1..4] (), 5 ( 1 5) 4 ( 1 4);
< > , Pascal, , Integer, Byte, Real, Boolean, Char, string, , .
:
{2 10 Integer. 1}
Vect1, Vect2: array [1..10] of Integer;
{ 8 6. 0}
Matr: array [0..7, 0..5] of Real;
{ 20 . 1}
StrList: array [1..20] of string;
( type). . :
- ;
- , var , , .. :=;
- , .
, :
Type
{ }
TMatrix = array [1..10, 1..20] of Real;
Var
{ TMatrix}
Matrix1, Matrix2, Matrix3: TMatrix;
.......................................
, . , . :
{ 3- }
Vect[3]:= 3.45; { }
Vect[3]:= Random; { }
Readln(Vect[3]); { }
{ 2- }
Value:= Vect[2]; { Value}
Writeln(Vect[2]); { }
{ }
Summa:= Vect[1] + Vect[2] + Vect[3];
():
{ 4, 3}
{ 4 , 3 }
Matrix[4, 3]:= 123.456;
Readln(Matrix[2, 4]); { (2, 4) }
Writeln(Matrix[I, J]); { (I, J) }
, . , - , :
for I:= 1 to 10 do { I 1 10}
Vect[I]:= Random; {I- }
Random, , ( ) .
|
|
program FindMaxElement;
const { }
Rows = 5; { }
Cols = 4; { }
Var
{ Rows x Cols}
Mas: array [1..Rows, 1..Cols] of Real;
I, J: Integer; { }
MaxValue: Real; { }
MaxRowIndex: Integer; { }
MaxColIndex: Integer; { }
Begin
{ }
for I:= 1 to Rows do { I ( )}
begin { begin..end }
for J:= 1 to Cols do { J ( )}
begin { begin..end }
{ (I, J) }
Mas[I, J]:= Random;
{ ( - )}
Write(Mas[I, J]:8:2, ' ');
if J = Cols then { , }
Writeln; { }
end;
end; { begin..end - }
{
MaxValue ,
, .
Mas, }
MaxValue:= Mas[1, 1]; { }
MaxRowIndex:= 1; { 1- }
MaxColIndex:= 1; { 1- }
{ }
for I:= 1 to Rows do { I ( )}
for J:= 1 to Cols do { J ( )}
Begin
{ (I, J) , MaxValue,
MaxValue }
if Mas[I, J] > MaxValue then
Begin
MaxValue:= Mas[I, J];
MaxRowIndex:= I;
MaxColIndex:= J;
end;
end;
{ }
Writeln('Max value=', MaxValue:8:2, '; Row=',
MaxRowIndex, '; Col=', MaxColIndex);
Readln;
end.
. , (. 3.8).
3.7. .
program Laba3;
Label
M1; { M1}
Var
SubTask: Char; { Char ()}
{**** ****}
Begin
Writeln(' :');
Writeln('a ');
Writeln('b ');
Writeln('e ');
M1:
Write(' :');
Readln(SubTask); { }
case SubTask of
'a', 'A':
begin { "a" "A", }
Writeln('a) ');
{******* ,
"" *******}
end;
'b', 'B':
begin { "b" "B", }
Writeln('b) - ');
{******* ,
"" *******}
end;
'e', 'E':
begin { "e" "E", }
Exit;
end; {begin..end }
else { ELSE ( CASE) begin..end }
{ , }
Writeln(' !');
Writeln(' !');
goto M1; { M1}
end;
Readln; { Enter}
end.
, , .
, Char , 256 , , , , (, ).
3.8.
1.) n!
) , .
2.) .
) .
3.) .
) .
4.) .
) .
5.) .
) .
6.) .
) .
7.) .
) .
8.) .
) , .
9.) .
) .