-

(44)

-
2003

: .., .., ..
: -
;
. . ...

, ,
,
.

220100
" , , " .

-
(). 2003.

6084
6,6 ..
.-.. 6,6 150 .
.

1/16

190000, , .., 67


.................................................................................................................................................... 4
1 ,
.................................................................................................................................................... 4
2 ............................................................................................................. 4
3 ................................................................................................................. 5
4 ............................................ 9
1. ............................................................................................. 10
2. ........................................................................................ 20
3. ........................................................................................................ 24
4. .................................................................................................... 34
5. ......................................................................................... 40
6 ...................................................................................... 49
7. .......................................................................... 61
8. ..................................................................................... 68
5 ............................................ 76
6 ........................................... 82
7 ................................................ 94
8 ........................................................................................................... 98
9 - ............................................................. 101
. ............................................................................ 102


,
220100
, ,
,
. ,
.
,
,
. ,
.
,
,
,
.

, ,
4.
1 ,

2
3
4

18
18
18

96
67
87

.
14
16

.
. .
9
13
36
60
6
12
11
45
22
9
9
18
69

. .

*
*
*
*
*

2

,
, ,
.


.
:
-
,
4


;
-
,
(Turbo Pascal, Object Pascal, C++ )
,
;
-
,
.
3
:
1.
. .
. . . .
. . :

,
,
,
,

. .

: , , .
. .
.
2.

. .

.
. . :
. .
: , , . :
. : .
. .

 3.
.
, , , , , .
. .
.
: ,
, , . :
, , .
: , , .
, .
.
.
4.
. ,
: , ,
. .
. .
. . :
, , , ,
.
. . :
, ,
, .
.
.
. . .
.
. , , .
.
.
. .
. .
. : ,
. : .
. . .
: c, , .
6

 .
5.
. , ,

-
.

.
: ,
, .
. .
: , , .
: , , ,
.
. .
.
. .
. .
. : -,
-, -.
. .
. . .
. .
. .
.

.
: .
.
. : ,
, .
.
. : , ,
, . .
. :
. .

.
.

 6. .
.
:
, , , , , ,
, , .
. , . .
, ,
. .

1.
4
4
20

2.
4
6
30

3.
6
9
6
6
20

4.
4
6
6
6
20

5.
6
9
5
31

6.6
6
30

30
24
12
33
151

4

, ,

.

1. 1. .
2. 2. .
3. 3. .
4. 4. .
5. 5. .
6. 6. .
7. 7. .
8. 8. .

,
,
,
, .
.
.

 1.
: - 3, - 4.
:

,
.

,

.

1.
: ,
.
2. : ,
,
( 3 6).
3. .
4. .
5. Real
. () .
6. .
,
.
7. : ,
, , ,
.

10


1)

2)
Y

3)

4)
Y

5)

6)
Y

11

8)

7)

9)

10)
Y

11)
Y

12

12)

13)
Y

14)

15)
Y

16)

17)
Y

13

18)

19)
Y

21)

20)

0
X

22)
Y

14

24)

23)

26)

25)

27)

28)
Y

R/2

Y=R/2

R/2

Y=R/2

0
X

15

29)

30)
Y

Y
Y=R/2

Y=R/2
R/2

R/2
0

31)

32)

Y=X2

Y=X2

Y=1

Y=1

33)

34)

Y=X2

Y=X2

Y=1

Y=1

16

36)

35)

X
-1

-1

Y=-1

Y=-X2

Y=-X2

37)

38)

Y
0

X
-1

Y=-1

-1

Y=-X2

Y
R

Y=X

Y=-1
Y=-X2

39)

-R

Y=-1

R X

-R

17


:
Y
R
R/2

X,Y

(.)

.
.

X=0 Y=0

X2+Y2>R2

S=(.) 4

y>=R/2

S=(.) 1

S=(.) 2

18

y<=|x|

S=(.) 3

Program Tochka;
{
: x, y
: s - }
Var x, y: Real;
s: String;
Begin
{ }
Write( :);
ReadLn(x, y);
{ }
If (x = 0) And (y = 0)
Then WriteLn ( );
Else Begin
If x * x + y * y > r * r { ?}
Then s:=
Else { }
If y >= r / 2
{ ?}
Then s:=
Else { }
If y <= - Abs (x)
Then s:=
Else s:= . ;
{ }
WriteLn ( :, s);
End;
End.

19

 2.
: - 3, - 4.
:

,
.

,

.

1.
: ,
.
2. :

,
- ,
,

.
3. .
4. .
5. .
.
6.

.
,
.
7. : ,
, , ,
.

20


1
, .
2
k- .
3
.
4
.
5
.
6
.
7
(, , , ),
.
8
(, , , )
.
9
, .
10
(, , , , , ),
(, , , , , , ).
11
,
(, , , , ).
12
k 1 99 k , ,
k .
21

13
k k ,
k.
14
d 1 999, ,
.
15
d 1 99, ,
.
16

. .
17
(, ,
, ) (., ., ., ., ., .).
18
(, , , ).
(, , , ).
.
19
.
20
, y (), m (), d ()
.
21
d (), m (), y() d1, m1, y1
.
22
,
d (), m ().
23
d (), m () k- .

22

24
, 1 wd1,
wd , d (), m
().
25
, 1 wd1,
, 13- .
CASE
Program PloFig;
{ .
: t - ,
a,l,h,r - .
: s - .
}
Var t:Byte;
a,l,h,r,s:Real;
Begin { }
WriteLn(' :');
Write('1-,2-,3-? ->');
ReadLn(t);
If (t<1)or(t>3)
Then Begin WriteLn(' !');
Write( Enter ->);
ReadLn; Halt;
End;
{ }
Case t Of
1: Begin Write(' ? ->');
ReadLn(a);
s:=a*a;
End;
2: Begin Write(' ? ->');
ReadLn(l,h);
s:=l*h;
End;
3: Begin Write(' ?->');
ReadLn(r);
s:=Pi*r*r;
End;
End;
WriteLn(' : ',s:10:5);
End.
23

 3.
: - 3, - 4.
:
,

.

,
, 3
: - ( ), - ( ),
- ( ).

1.
: ,
.
2. .
3. .
.
4. .
5. For
.
, :
While Repeat.
6. .
.
7. .
8. : ,
, , ,
.

24


1
1.

X, m S:
S

2m 1

i X

i 1, 3, 5,...

2.
{ Y n } n , Yn
Yn 0.25 sin(Yn 1 ) sin(Yn 2 ); n 2,3,4
Y0, Y1 .
Yn - Yn-1<.
2
1.

X, m P:
m

P (m
i 1

X
)
m i 1

2.
{Yn} n , Yn
Yn= 0.2 + 0.1 sin(Yn-1); n=1,2,3...
Y0 .
Yn Yn-1<.
3
1.

A, B, n, m X S:
n

S A ( X
i m

B 2
)
i

2.
{Yn} n , Yn

Yn=0.1 tg ( Yn 1 ) + 0.3 tg ( Yn 3 ); n=3,4,5...

Y0, Y1, Y2 .
Yn Yn-1<.
4
1.

A, B, n X S:
S A B

X A B i
i 2 , 4 , 6,... X A B i
n

25

2.

{Yn} n , Y0=0, Yn

Yn

1
; n 1,2,3...
1 Yn 1

Y0 .
Yn Yn-1<.
5
1.

A, B, n, m X S:
n

S A B (1) i
i m

2.

A X i
B X i

{Yn} n , Yn

Yn 0.352 Yn 1 cos(

Yn 2 ); n 2,3,4...

Y0, Y1 .
Yn Yn-1<.
6
1.

S Y=f(x):
S
i

x 2 3x 2
2x 2 1

; x 0.1 i; i 1,40

2. {Yn} n , Yn

Yn

1
12 Yn21 Yn2 2

; n 2,3,4...

Y0, Y1 .
Yn Yn-1<.
7
1.

S Y=f(x):
x2 1
S lg(
) ; x 0.2 i; i 1,10
(i 1)!
i

2.
{Yn} n , Yn

Yn

1
10 Yn2 2 Yn23

; n 3,4,5...

Y0, Y1, Y2 .
Yn Yn-1<.

26

8
1.

X S:
S

( X 2) ( X 4) ( X 8) ... ( X 128)
( X 1) ( X 3) ( X 7) ... ( X 127)

2.
{Yn} n , Yn

Yn

1 sin 2 Yn 1 sin 2 Yn 2

; n 2,3,4...

Y0, Y1 .
Yn Yn-1<.
9
1.
N (2 N )!!
2.
{Yn} n , Yn

Yn

Yn 2 0.5 Yn 3
; n 3,4,5...
Yn2 2 2Yn43 1.5

Y0, Y1, Y2 .
Yn Yn-1<.
10
1.

N (2 N 1)!!

2.

:
Y1

Yn = Yn(x),

0 X 1

X
1
; Yn ( X Yn21 ); n 2,3,4...
2
2

X ,
Yn, Yn Yn-1<.
11
1.

, 5, [A,B].

2.
Yn = Yn(x), X >0
:
Y1 X ; Yn Yn 1 (2 X Yn 1 ); n 2,3,4...

,
Yn, Yn Yn-1<.

27

12
1.

, 7, [A,B].

2.

P (1

n 1

1
)
Yn

{Yn},

Y1 1; Yn n(Yn1 1); n 2,3,4,...

1
.
Yn

13
1. , 5 3,
[A,B].
2. K A - k- A,

X 0 A; X n

k 1
A
X n 1
; n 1,2,3,...
k
k X nk11

X n , |Xn Xn-1| <

14
1.
, 7 4,
[A,B].
2.
X-q*sin(X)=m, 0<q<1
X 0 m, X1 m q * sin( X 0 ),..., X n m q * sin( xn 1 ),...
m ,
X n , |Xn Xn-1| < .
15
1.

m,
m

S m Yi Y0, Y1, Y2, Yi

i 1

Yi lg Yi 2 2 Yi 3 1 ; i 3,4,5,...
2.

{Yn} n , Yn

Yn

n
n2 1 2 * n2 1

Yn Yn-1<.

28

16
1.
m,
Ym, Y0, Y1,Y2, Yi
Yi tg 2 (Yi 3 ) Yi 2 ; i 3,4,5,... ,m
5* n

2.

lim
n

17
1.

m,

3 * (n 2 1) 2 * (n 2 1)

Sm ln( Yi 0.5), Y0, Y1, Y2, Yi

i 1

Yi Yi 1 Yi 22 2 * Yi 3 ; i 3,4,5,... ,m
2.

lim
n

n3 5
.
2 * n3 n2 1

18
1.
m,
Ym, Y0, Y1, Yi
2 * Yi 1 Yi 2
Yi
; i 2,3,4,... ,m
3
2.

n
n 1

1
.
* (sin(n) 1.1)

19
1.
m,
Ym , Y0 ,Y1,Y2, Yi
Yi= sin2 (Yi-1) + cos2 (Yi-3); i=3,4,5, ,m
2.

n * (n A)

n 1

20
1.

m,
m

Sm Yi , Y0, Y1, Y2, Yi

i 1

Yi sin(Yi 1 ) cos(Yi 3) ; i=3,4,5,,m

2.

(5 * n 1) * (5 * n 1)
n 1

29

21
1.

m,
m

Sm Yi 2 Y0 ,Y1, Yi
i 1

Yi
2.

sin(Yi 1 ) cos(Yi 2 ) ; i=2,3,4,,m

(1)

n 1

n
.
2 * n2 1

22
1.
{Xi} {Yi}
. X20 ,Y20,

X i *(Yi 5) 1
X i 1
; X 0 3.5;
2
Yi 1 X i 1.6;Y0 2.2

2.

n 1

30

cos(

30 0 )
n

 FOR
Program Fibon;
{ .
:
n - .
: fn - .}
Var n,i:Byte; { 0..255 }
{ i- }
fn,fi,fi1,fi2:Longint;
{fi- , fi1- ,
fi2- .}
Begin {$R+}
Write(' ? '); ReadLn(n);
If n>46
Then Begin WriteLn(' !');
Write( Enter->);
ReadLn; Halt;
End;
If n<2 Then fn:=n
Else Begin fi2:=0; fi1:=1;
For i:=2 To n
Do Begin fi:=fi1+fi2;
fi2:=fi1;
fi1:=fi;
End;
fn:=fi;
End;
WriteLn(' F',n,' = ',fn);
End.

31

 WHILE
Program ProSum;
{ }
{ : c - .
: p - , s - .}
Var c,p,s,a,b:Real;
i,j:Byte; {i- , j-
a- , b- }
Begin WriteLn(' 0<c<1:');
ReadLn(c);
If (c<=0)or(c>=1)
Then Begin WriteLn(' !');
Write( Enter->);
ReadLn; Halt;
End;
{ }
p:=1; i:=0;
While p>=c
Do Begin i:=i+1; a:=1-i/(i+1); p:=p*a;
End;
WriteLn(' <',c:6:3,' = ',p:7:5);
{ }
s:=0; j:=0;
While s<=c
Do Begin j:=j+1; b:=1/j/(j+1); s:=s+b;
End;
WriteLn(' >',c:6:3,' = ',s:7:5);
End.

32

 REPEAT WHILE
Program KvadrKoren;
{
.
: x - , eps - .
: y - }
Var x,y,yp,eps:Real;
{y - ,
yp - }
Begin Write(' >0 : ');
ReadLn(x);
If x<0 Then Begin WriteLn(': <0!');
Write( Enter->);
ReadLn; Halt;
End;
Write(' 0<eps<<1 : ');
ReadLn(eps);
If(eps<=0)Or(eps>0.1)
Then Begin WriteLn(': <=0 >0.1!');
Write( Enter->);
ReadLn; Halt;
End;
{ Repeat - Until}
yp:=(x+1)/2;
Repeat y:=0.5*(yp+x/yp);
yp:=y
Until Abs(y*y-x)<eps;
WriteLn('Repeat: ',x:6:3,'=',y:5:3);
{ While - Do}
yp:=(x+1)/2; y:=0;
While Abs(y*y-x)>eps
Do Begin y:=0.5*(yp+x/yp);
Yp:=y;
End;
WriteLn('While: ',x:6:3,'=',y:5:3);
End.

33

 4.
: - 3, - 4.
:

;

.

,

.

1. :
.
2. : ,
, .
3. :
.
4. .
5. .
6. .
c .
7. , .
, ,
.
8. : ,
, , ,
.

34


1
b1,b2,,b2n. x1,x2,,xn
y1,y2,,yn, : b1,b3,,b2n-1
b2,b4,,b2n.
2
a1,a2,,am.
. , i- ,
a i , 1 .
3

:
a1 , a1 a 2 , a1 a 2 a3 ,..., a1 a 2 a3 ... a n a1,a2,,an.

4
x1,x2,,xn ,
.
5
a1,a2,,an b1,b2,,bn. , :
a1 , b1 , a 2 , b2 ,..., a n , bn .
6
x1,x2,,xm. ,
, b.
7
x1,x2,,xn y1,y2,,yn. :
xi yi xi,
yi.
8
a1,a2,,an.
, ,
, . .
9
,
x1,x2,,xn (n>=2) ,
x2,x3,,xn,x1.
35

10
a1,a2,,an.
, , ,
, b.
11

b1,b2,,bn, : 2i<bi<i!. ,
.
12
1,2,,n ,
: n,n-1,,1.
13
1,2,,n
. ,
.
14
1,2,,3n b1,b2,,bn,
.
15
b1,b2,,bn.
,
.
16
1,2,,n, .
,
. .
17
1,2,,n.
, [x,y], ,
, .
18
1,2,,n. ,
, .

36

19
:
1,2,,n, , .
.
20
x1,x2,,xn .
.
21

i,i+1,,i+k , .

1>2>>n

22
b1,b2,,b2m. ,
: b2m,b1,b2m-1,b2, ,bm+1,bm.
23
x1,x2,,xn. ,
, .
24
1,2,,2n. ,
: 1,n+1,2,n+2,,n,a2n.
25
1,2,,n.
,
.
26

n .
27
x1,x2,,xn
y1,y2,,ym z1,z2,,zn+m, .
. .
28

n .

37

29
b1,b2,,bm.
30
1,2,,n.
31

a1,a2,,an, .
32
2 a1,a2,,an b1,b2,,bn.
a1b1 a 2 b2 ... a n bn .
33

.

a12 a 22 ... a n2 , a1,a2,,an

34
, , a1, a2,, am
.
35
y1<y2<<ym x. ,
y1< x <=ym. ,
:
yk-1< x <yk.
36

x1, x2,, xm.
37
x1, x2,, xn.
, [a,b].
38
x1,x2,,xm. ,
,
[c,d].

38


Program MinMaxMas;
{

: k - ,
M - .
: M - .}
Const R=10;
{ }
Type Tind=1..R; { }
Tmas=Array [Tind] Of Integer; { }
Var k,i,nmin,nmax:Tind;
{1..R}
M:Tmas;
{ }
min,max:Integer;
{ }
Begin
{$R+} { }
Write(' ',R,': ');
ReadLn(k);
{ }
Write(' ',k,' :');
For i:=1 To k
Do Read(M[i]);
{ }
{ }
min:=M[1]; nmin:=1; { }
max:=M[1]; nmax:=1; { }
For i:=2 To k
{ }
Do If M[i]<min
{ }
Then Begin min:=M[i];
{ }
nmin:=i
{ }
End
Else If M[i]>max { }
Then Begin max:=M[i]; { }
nmax:=i
{ }
End;
{ }
M[nmin]:=max; M[nmax]:=min;
{ }
WriteLn(' :');
For i:=1 To k
Do Write (M[i],' '); { }
WriteLn;
End.

39

 5.
: - 3, - 4.
:
, ,

;

,
.

,
,


.

1. :
) ; ) .
2.
.
3. : , ,
, , .
4. :
. .
5. .
.
6. .
.
7. , .
8. ,
.
.
9. : ,
, , ,

40

41

:
10

11

12

42

13

14

15

16

17

18

43


1
,
.
2

, .
3

, .
4

, .
5

, .
6

, .
7

: , , ,
.
8

, .
9

, .
10

, .
11

, .
44

12

.
13

: , , ,
.
14
,
.
15

, .
16
: ,
, ,
.
17
:
, , ,
.
18

.
19

, .
20

, .

45


Program MatrInt;
{ :
}
Uses Crt;
{ }
Const R=10;
{ () }
Type Tind=1..R;
{ }
Tvect=Array[Tind] Of Integer; { }
Tmatr=Array[Tind] Of Tvect;
{ }
{$R+}
Procedure InMatr(kStr,kStb:Tind;Var M:Tmatr);
{ .
:
kStr - ,
kStb - .
:
M - .}
Var i,j:Tind;
{ }
Begin WriteLn(' :');
For i:=1 To kStr
Do Begin
For j:=1 To kStb
Do Read(M[i,j]);
ReadLn;
End;
End;{InMatr}
Function NomMin(kStr,kStb:Tind; Const M:Tmatr):Tind;
{ .
:
kStr - ,
kStb - ,
M - .
: NomMin - .}
Var i,j,nmin:Tind; min:Integer;
{ }
Begin
min:=M[1,1]; nmin:=1;
For i:=1 To kStr
Do For j:=1 To kStb
Do If M[i,j]<min
Then Begin min:=M[i,j];
nmin:=i;
End;
NomMin:=nmin;
End; {NomMin}
46

Function NomMax(kStr,kStb:Tind; Const M:Tmatr):Tind;

{ .
:
kStr - ,
kStb - ,
M - .
: NomMax - .}
Var i,j,nmax:Tind; max:Integer;
{ }
Begin
max:=M[1,1]; nmax:=1;
For i:=1 To kStr
Do For j:=1 To kStb
Do If M[i,j]>max
Then Begin max:=M[i,j];
nmax:=i;
End;
NomMax:=nmax;
End; {NomMax}
Procedure ObmenStr(kStr,kStb:Tind; Var M:Tmatr);
{
.
:
kStr - ,
kStb - ,
M - .
:
M - .}
Var strM:Tvect; nmin,nmax:Tind;
{ }
Begin
nmin:=NomMin(kStr,kStb,M);
nmax:=NomMax(kStr,kStb,M);
If nmin<>nmax
Then Begin strM:=M[nmin];
M[nmin]:=M[nmax];
M[nmax]:=strM;
End;
End; {ObmenStr}
Procedure Okno(x1,y1,x2,y2,cf,ct:Byte);
{ }
Begin
Window(x1,y1,x2,y2); { }
TextBackGround(cf); { }
TextColor(ct);
{ }
ClrScr;
{ }
End;{Okno}
47

Procedure OutMatr(kStr,kStb:Tind; Const M:Tmatr);

{ .
:
kStr - ,
kStb - ,
M - .}
Var i,j:Tind;
{ }
Begin
For i:=1 To kStr
Do Begin For j:=1 To kStb
Do Write(M[i,j]:3);
WriteLn;
End;
End;{OutMatr}
Var n,m,nStb:Tind; Matr:Tmatr;
Begin
Okno(1,1,80,25,0,15);
{ }
Write(' ? '); ReadLn(n,m);
Okno(1,6,38,20,2,15);
{
}
InMatr(n,m,Matr);
{ }
WriteLn(' ');
OutMatr(n,m,Matr);
{ }
ObmenStr(n,m,Matr);
{ }
Okno(40,6,80,20,3,15);
{
}
WriteLn(' ');
OutMatr(n,m,Matr);
{ }
ReadLn;
End.

48

 6
: - 3, - 4.
:
,
;
,
;
;

.


5
.
. !

1. .
2.
.
3.

,
, ,
. .
.
4. .
.
5.
.
6. : ,
, , ,

49


1
. ;
- , .
,
(). .
.
2
. ;
- , .
,
. .
.
3
.
; - ,
. ,
. .
4
.
; - ,
. ,
. .
5
.
; - ,
. ,
. .
6
. ;
- , .
,
. .

50

7
.
; - ,
. ,
(). .
.
8
.
; - ,
. ,
.
9
. ;
- , .
.
10
.
; - ,
. ,
.
.
11
.
; - ,
. ,
. .
12
.
; - ,
. ,
. .
13
.
; - ,
. ,
.
.
51

14
.
; - ,
. ,
:
. .
15
.
; - ,
. ,
:
(a, ab, abc, abcd,).
.
16
.
; - ,
. ,
:
(z, yz, xyz,).
.
17
.
; - ,
. ,
:
. .
18
.
; - ,
. ,
:
. .
19
.
; - ,
. ,
:
. .
52

20
.
; - ,
. ,
,
: .
.
21
.
; - ,
. ,
,
: .
.
22
.
; - ,
. ,
,
: . .
23
.
; - ,
. ,
,
: .
.
24
.
; - ,
. ,
,
: .
.

53

25
.
; - ,
. ,
,
:
. .
26
.
; - ,
. ,
,
: .
.
27
.
; - ,
. ,
,
: , .
.
28
.
; - ,
.
.
29
.
; - ,
. ,
( ) ,
. .
30
.
; - ,
. ,
.

54

31
.
; - ,
. ,
. .
32
.
; - ,
. .

55


Program FileText;
{ }
Uses Crt; { Crt}
Procedure Exist(Var nameFT:String);
{ }
Var ch:Char;
FT:Text;
Begin
Assign(FT,nameFT);
{$I-}
{ -}
Reset(FT);
{$I+}
{ -}
If IOResult=0
Then Begin
WriteLn(' !');
Write(' ? Y/N ->');
ReadLn(ch);
If ch In ['n','N','','']
Then Repeat
WriteLn(' :');
ReadLn(nameFT);
Assign(FT,nameFT);
{$I-}
Reset(FT);
{$I+}
If IOResult=0
Then Begin
WriteLn(' !');
Write(' ? Y/N->');
ReadLn(ch);
End;
Until (IOResult<>0)Or(ch In['y','Y','','']);
End;
End;
Procedure SozdFT(Const nameFT:String);
{ }
Var
FT:Text;
i:Byte;
st:String;
Begin
56

Assign(FT,nameFT);
ReWrite(FT); { }
Write(' . ');
WriteLn(' - .');
i:=0;
WriteLn(' ',i+1,'- :');
ReadLn(st);
{ }
While st<>''
{ }
Do Begin
WriteLn(FT,st); { }
Inc(i);
WriteLn(' ',i+1,'- :');
ReadLn(st);
End;
WriteLn(' ',i,' ');
Close(FT);
{ }
End;

Procedure ProsmFT(Const nameFT:String);

{ }
Var st:String;
FT:Text;
Begin
Assign(FT,nameFT);
Reset(FT);
{ }
If Eof(FT) Then Begin
Writeln(' !');
WriteLn(' Enter ->');
ReadLn; Halt;
End;
Writeln(' :'); Writeln;
While Not Eof(FT)
{ :}
Do Begin
Readln(FT,st);
{ }
Writeln(st);
{ }
End;
Writeln;
Close(FT);
{ }
End; {ProsmFT}
Procedure RedaktFT(Const nameF1,nameF2:String);
{ .
57

 : F1 - .
: F2 - .}
Procedure UdalLP(Var st:String);
{ .
: st- , .
: st - .}
Var L,i:Byte;
Begin
L:=Length(st); { }
i:=1;
{ }
While i<=L
{ }
Do Begin
If st[i]=' ' { - }
Then Begin
If (i=1) Or (i=L)
{ }
Then Delete(st,i,1)
Else If (i<L) And (st[i+1]=' ')
Then Delete(st,i+1,1)
Else i:=i+1; { }
L:=Length(st);
{ }
End
Else i:=i+1; { }
End;
End; {UdalLP}
Procedure LexSort(Var st:String);
{ .
: st- , .
: st - .}
Function Slovo(pn:Byte; st:String):String;
{ .
: pn - ,
st - .
: Slovo - .}
Var L,p:Byte;
Begin
L:=Length(st); p:=pn;
{ }
While (p<=L)And(st[p]<>' ') { }
Do p:=p+1;
{ }
Slovo:=Copy(st,pn,p-pn);
{ }
End;{Slovo}
58

Var L,p1,p2:Byte;
{L - ,
p1,p2 - }
sl1,sl2:String;{ }
flag:Boolean; { }
Begin
L:=Length(st); { }
Repeat
flag:=FALSE; { }
p1:=1; sl1:=Slovo(p1,st); { }
While p1+Length(sl1)<L { sl1 }
Do Begin
p2:=p1+Length(sl1)+1;{ 2- }
sl2:=Slovo(p2,st);
{ }
If sl2<sl1
Then Begin
{ }
Delete(st,p1,p2+Length(sl2)-p1);
Insert(sl2+' '+sl1,st,p1);
p1:=p1+Length(sl2)+1;
flag:=TRUE;
{ }
End
Else Begin { }
sl1:=sl2; { }
p1:=p2;
{ }
End;
End;
Until Not flag; { }
End; {LexSort}
Var F1,F2:Text;
st:String;
Begin
Assign(F1,nameF1); Assign(F2,nameF2);
Reset(F1); Rewrite(F2);{ }
While Not Eof(F1)
{ }
Do Begin
ReadLn(F1,st); { ,}
UdalLP(st);
{ ,}
LexSort(st);
{ ,}
WriteLn(F2,st);{ .}
End;
Close(F1); Close(F2);
{ }
End; {RedaktFT}

59

{ }
Var nameF1,nameF2:String; { }
Begin
ClrScr;
{ }
Write(' : ');
ReadLn(nameF1);
Exist(nameF1);
SozdFT(nameF1);
{ }
Write(' ');
ProsmFT(nameF1);
Write(' : ');
ReadLn(nameF2);
Exist(nameF2);
RedaktFT(nameF1,nameF2); { }
Write(' '); ProsmFT(nameF2);
ReadLn;
End. {FileText}

60

 7.
: - 3, - 4.
:
,
;

;
;

.


5,
.
!

1. .
2.
.
3.
.
4. : ,
, , , .
5.
.
6.
.
7. : ,
, , ,
.

61

. .

62

10

11

12

13

14

1 .

15

16

17

18

19

20

21

63


Program FileZap;
{ }
Const MAX_DL=15; { }
KOL_OC=3; { }
Type Tzap=Record
fam:String[MAX_DL];
{}
OC:Array[1..KOL_OC] Of 0..5; {}
End;
Tfile=File Of Tzap;
Function FileExist(Const nameF:String):Boolean;
{ .
: nameF - .
: FileExist - .}
Var F:File; { }
Begin Assign(F,nameF);
{$I-} { -}
Reset(F); { }
{$I+} { -}
If IOResult=0 { ?}
Then Begin FileExist:=TRUE; Close(F); { }
End
Else FileExist:=FALSE;
End; {FileExist}
Procedure SozdFZ(Const nameF:String);
{ .
: nameF - .}
Var z:Tzap; j:Byte; otv:Char; FZ:Tfile;
Begin If FileExist(nameF) { ?}
Then Begin WriteLn(' ',nameF,' !');
Exit; { }
End;
Assign(FZ,nameF);
Rewrite(FZ);
{ }
WriteLn(' :');
Repeat Write(' ? '); ReadLn(z.fam);
Write(' ? '); For j:=1 To KOL_OC
Do Read(z.OC[j]); ReadLn;
Write(FZ,z); { }
Write(' ? '); ReadLn(otv);
Until Not ( otv In ['','','Y','y']);
64

Close(FZ);
End; { SozdFZ }

{ }

Procedure ProsmFZ(Const nameF:String);

{ .
: nameF - .}
Var z:Tzap; j:Byte; FZ:Tfile;
Begin If Not FileExist(nameF) { ?}
Then Begin WriteLn(' ',nameF,' !');
Exit;
End;
Assign(FZ,nameF);
Reset(FZ); { }
If Eof(FZ) { ?}
Then Begin WriteLn(' ',nameF,' !');
Exit;
End;
WriteLn(' : ',nameF);
While Not(Eof(FZ))
{ }
Do Begin Read(FZ,z); { }
Write(z.fam,' ':MAX_DL-Length(z.fam)+1);
For j:=1 To KOL_OC
Do Write(z.OC[j]:3); WriteLn
End;
Close(FZ); { }
End; {ProsmFZ}
Procedure SortFZ(Const nameF:String);
{
.
: nameF - .}
Function SumB(z:Tzap):Byte;
{ .
:
z - .
: SumB - .}
Var s,j:Byte;
Begin s:=0;
For j:=1 To KOL_OC
Do s:=s+z.OC[j];
SumB:=s
End; {SumB}

65

Var z1,z2:Tzap; i:Word; flag:Boolean; FZ:Tfile;

nkz:Word; { }
Begin
If Not FileExist(nameF) { ?}
Then Begin WriteLn(' ',nameF,' !');
Exit;
End;
Assign(FZ,nameF);
Reset(FZ);
{ }
nkz:=FileSize(FZ)-1; { }
flag:=TRUE;
{ }
While (nkz>0) and flag { }
Do Begin
flag:=FALSE;
{ }
For i:=0 To nkz-1 { }
Do Begin
Seek(FZ,i);
Read(FZ,z1,z2);{ }
If SumB(z1)<SumB(z2)
Then Begin { }
Seek(FZ,FilePos(FZ)-2);
Write(FZ,z2,z1);{ }
flag:=TRUE;
{ }
End;
End; { For }
nkz:=nkz-1;
End; {While}
Close(FZ) { }
End; {SortFZ}
Procedure UsechFZ(Const nameF:String;kz:Word);
{ .
: nameF - ,
kz - .}
Var
FZ:Tfile;
Begin
If Not FileExist(nameF)
{ ?}
Then WriteLn(' UsechFZ: ',nameF,' !')
Else Begin
Assign(FZ,nameF);
Reset(FZ);
{ }
If kz<FileSize(FZ) { ?}
Then Begin Seek(FZ,kz); { }
Truncate(FZ);
{ }
Close(FZ);
{ }
66

End;
End;
End; {UsechFZ}
{ }
Var nameFZ
{ }
kStud:Word; { }
r:0..4;
{ } {$R+}
Begin
WriteLn{ :}
ReadLn(nameFZ);
Repeat
WriteLn(' !');
WriteLn('1 - , 2 - ,');
Write('3 - , 4 - , 0 - : ');
ReadLn(r);
Case r Of
1: SozdFZ(nameFZ);
{ }
2: SortFZ(nameFZ);
{ }
3: ProsmFZ(nameFZ);
{ }
4: Begin Write(' ? ');
ReadLn(kStud);
UsechFZ(nameFZ,kStud); { }
End;
End; {Case}
WriteLn;
Until r=0;
End.

67

 8.
: - 3, - 4.
:

;

.



5 .

1. .
2.
.
3. , ,
, .
4.
.
5. : ,
, , ,
.

68


1
L L1 L2:
, .
2
L E1
E, L.
3
L 1 ,
L.
4
L
1 2.
5
L, ,
E , .
6
L.
7
L .
8
L .
9
L ,
.
10
L .
11
L
.

69

12
L, ,
.
13
, L1 L2.
14
, L .
15
L1 L2.
16
L1 L.
17
L1 L2.
18
L L1,
L.
19
L, ,
L1 L2.
20
L, ,
L1 L2.
21
L, ,
L1, L2.
22
L, ,
L1 L2, .
23
L1 L2 ,
L.

70

24
L1 L2 L1,
L1 L2.
25
.
26
.
27
, .
28
.
29
.
30
.
31
.
32
.
33
, .
34
.
35
, .
36
L 1 2.
37
.

71

38
.
39
, L.
40
L.
41
.
42
L , .
43
,
.
44
, ,
.
45
, .

72


Program Spisok;
{ }
Type Tinf=Char;
{ }
TP=^Tel;
{ }
Tel=Record
{ }
inf:Tinf;{ }
pSled:TP;{ }
End;
Procedure Init(Var head:TP);
{ }
Begin
head:=NIL;
End;{Init}
Procedure InSpN(infEl:Tinf; Var head:TP);
{ }
Var pn:TP; { }
Begin
New(pn); { }
pn^.inf:=infEl; { }
pn^.pSled:=head;{ }
head:=pn;
{ }
End;{InSpN}
Procedure SozdSpN(Var head:TP);
{ :
}
Var s:Char;
Begin
Init(head); { }
WriteLn(' ! * ');
Repeat
Read(s);
InSpN(s,head) { }
Until s='*';
ReadLn;
End;{SozdSpN}

73

Procedure InitZ(infEl:Tinf; Var head:TP);

{ }
Begin
New(head); { }
head^.inf:=infEl; { }
head^.pSled:=NIL; { }
End;{InitZ}
Procedure InSpP(infEl:Tinf; Var pred:TP);
{ }
Var pn:TP; { }
Begin
If pred<>NIL { ?}
Then Begin
New(pn);
pn^.inf:=infEl; { }
pn^.pSled:=pred^.pSled; { }
pred^.pSled:=pn; { }
pred:=pn;
End;
End;{InSpP}
Procedure SozdSpP(Var head:TP);
{ :
}
Var s:Char; pred:TP;
Begin
InitZ(' ',head);
pred:=head; { }
WriteLn(' ! * ');
Repeat
Read(s);
If s<>'*'
Then InSpP(s,pred){ }
Until s='*';
ReadLn
End;{SozdSpP}
Procedure ProsmSp(head:TP);
{ }
Var pt:TP; {C }
Begin
If head=NIL
Then Begin
WriteLn(' !');
74

Write( Enter ->);

ReadLn; Exit;
End;
WriteLn(' :');
pt:=head; { }
While pt<>NIL
Do Begin
Write(pt^.inf);
pt:=pt^.pSled;{ }
End;
WriteLn;
End; {ProsmSp}
Procedure OutSpN(Var head:TP);
{ }
Var pu:TP; { }
Begin
If head<>NIL
Then Begin
pu:=head; { }
head:=head^.pSled;
Dispose(pu);
End;
End; {OutSpN}
{ }
Var head:TP;
Begin
SozdSpN(head); { }
Write(' '); ProsmSp(head);
OutSpN(head); { }
Write(' '); ProsmSp(head);
SozdSpP(head); { }
Write(' '); ProsmSp(head);
ReadLn;
End.

75

5

, .

4.
.
1:

1.
: ,
, .
2. :
.
3.
.
4. .
5. .
6. .
7.
. c .
8. : ,
, , ,
.
1

6

V = D mod 32 + 1
V ;
D ;
mod .
, 03467,
V = 67 mod 32 + 1 = 3 + 1 = 4, , :

76

4
.
; - ,
. ,
. .

Program LexSortStr;
{ }
Procedure LexSort(Var st:String);
{ .
: st - .
: st - .}
Function Slovo(pn:Byte; st:String):String;
{ .
: pn - ,
st - .
: Slovo - .}
Var L,p:Byte;
Begin L:=Length(st); p:=pn;
{ }
While (p<=L)And(st[p]<>' ') { }
Do p:=p+1;
{ }
Slovo:=Copy(st,pn,p-pn)
{ }
End;{Slovo}
Var L,p1,p2:Byte;
{L - ,
p1,p2 - }
sl1,sl2:String;{ }
fp:Boolean;
{ }
Begin
L:=Length(st); { }
Repeat
fp:=FALSE; { }
p1:=1; sl1:=Slovo(p1,st); { }
While p1+Length(sl1)<L { sl1
}
Do Begin
p2:=p1+Length(sl1)+1;{ 2- }
77

sl2:=Slovo(p2,st);
{ }
If sl2<sl1
Then Begin
{ }
Delete(st,p1,p2+Length(sl2)-p1);
Insert(sl2+' '+sl1,st,p1);
p1:=p1+Length(sl2)+1;
fp:=TRUE { }
End
Else Begin { }
sl1:=sl2; { }
p1:=p2;
{ }
End;
End;
Until Not fp { }
End; {LexSort}
Var st:String;
Begin
Write(' : ');
ReadLn(st);
LexSort(st);
WriteLn(' : ',st);
WriteLn; ReadLn;
End.

2: .

1.
: ,
, .
2. :
.
3. .
!
4.
.
5. : , ,
, .
78

6.
.
7.
. c .
8. , .
9. : ,
, , ,
.
2

7

V = D mod 21 + 1
V ;
D ;
mod .
, 03469,
V = 69 mod 21 + 1 = 6 + 1 =7, , :
7
7

Program MasZap;
{ }
Const KMAX=10; { }
Type Tzap=Record
name:String[15];
{}
area:Real;
{}
popul:Real;
{}
End;
Tmas=Array[1..KMAX] of Tzap;
{$R+}
79

Procedure SozdMZ(Var kz:Byte; Var MZ:Tmas);

{ .
: kz - ,
MZ - .}
Var i:Byte;
Begin Write(' ', KMAX,': ');
ReadLn(kz);
For i:=1 To kz Do
Begin Write(' ? ');
ReadLn(MZ[i].name);
Write(' ? ');
ReadLn(MZ[i].area, MZ[i].popul);
End;
End; { SozdMZ }
Procedure SortMZ(kz:Byte;Var MZ:Tmas);
{ .
: kz - ,
MZ - .
: MZ .}
Var i:Byte; z:Tzap; flag:Boolean;
Begin
If kz=0
Then Begin WriteLn(' !');
WriteLn( Enter ->);
ReadLn; Exit; { }
End;
Repeat
flag:=FALSE;
For i:=1 To kz-1
Do If MZ[i].popul/MZ[i].area<MZ[i+1].popul/MZ[i+1].area
Then Begin z:=MZ[i];
MZ[i]:=MZ[i+1];
MZ[i+1]:=z;
flag:=TRUE;
End;
Until Not flag;
End; {SortMZ}
Procedure OutMZ(comStr:String;kz:Byte;Const MZ:Tmas);
{ .
: comStr - ,
kz - ,
MZ - }
Var i:Byte;
80

Begin
If kz=0
Then Begin
WriteLn(' !');
Write( Enter ->);
ReadLn; Exit; { }
End;
WriteLn(ComStr:40); WriteLn;
WriteLn(' ','':20,'':20);
WriteLn;
For i:=1 To kz
Do With MZ[i]
Do WriteLn(name:16,area:20:7,popul:20:7);
WriteLn;
End; {OutMZ}
Var { }
ks:Byte; { }
MS:Tmas; { }
Begin
SozdMZ(KS,MS);
OutMZ(' ',ks,MS);
SortMZ(KS,MS);
OutMZ(' ',ks,MS);
Write(' Enter ->');
ReadLn;
End.

81

6

, .

, ,
.
.
.
1. .

1

( ).
2
.

. , 4 : 4, 3+1, 2+2, 2+1+1,
1+1+1+1.
3

Cnm :
1, m=0, n>0 m=n>=0;
C(n,m) = 0, m>n>=0;
C(n-1,m-1) + C(n-1,m) .
4
,
f(x)=0 [a,b] .
5
. min(x)
x,
min1(k), , k.

82

6
.
, , s,
i- j- .
7
, 0.
,
( ).
8
n
: -
(, ) ,
,
(
),
.
9
. ,, n ,
1 n .
.
, :
, .
, ,
n , n .
10
n , 1 n.
. , 1 n-.
i j (i<j), , i- j- .
11
n . .
12
: 8 ,
. 92 .

83

13
n m, (n,m). ,
,
(n,m)=(m,r), r n m.
14
u0,u1,u2, :
u0=0, u1=1, un=un-1+ un-2 (n=2,3, ). un
n, .
15
a,c,m. f(m),
n, 0<=n<=9;
f(n) =
g(n)f(n-1-g(n))+n .
g(n) = a(n+c) 10.
,
f(n).
16
n m. A(n,m) :
m+1, n=0;
A(n,m) = A(n-1,1), n<>0, m=0;
A(n-1,A(n,m-1)), n>0, m>0.
, .
17

1,
.
n. n
. .

1
1

1 2 1
1 3 3 1
1 4 6 4 1

18
m,n1,,nm (m>=2).

(n1,,n)=((n1,,n-1),nk)
( =3,,n ) .
19
t0=1, tk=t0tk-1+ t1tk-2++ tk-2t1+ tk-1t0, k=1,2, . tn.

84

(n1,,nm),

20
2n+1 , n n
(n , n , ).
, .
, ,
. ,
, .
21
2n , n n-1
(1,...,n , n+1 , n+2,...,2n
). .
, ,
.
, .
, ,
.
22
4 4 16 ( , b, c,
d ) ,
. .
23
9 3 3 1, 2,
3 , , ,
, 6. .
24
3 3 1,2,3,4,5,6,7,8,9 ,
, , ,
.
25
4 4 15
1 15. .
.
. ,
, .

85


Program FactRecFunc;
{ }
Function FactR(k:Byte):Longint;
{ F=K!
: k - .
: FactR - .}
Begin
If k=0 Then FactR:=1
Else FactR:=k*FactR(k-1);
End; { FactR }
Const P=12; { }
Var
n:0..P; f:Longint;
Begin {$R+}
Write(' 0<=n<=',P,': ');
ReadLn(n);
f:=FactR(n);
WriteLn(n,'! = ',f);
End.
2. .
, 2*n 2*n
.
, .


1
.
2
.
3
.
4
.
86

5
.
6
.
7
.
8
.
9
.
10
.
11
.

12
.
13
.
14
.
15
.

16
.
17
.
18
.

87

B1

B2

B3

B4

B5

B6

B7

B8

88

89


1
Program SortMas;
{ }
Const R=10;
{ }
Type Tind=1..R;
Tmas=Array[Tind] Of Integer;
Procedure SortVibor(n:Tind; Var M:Tmas);
{
}
Var i,k,imin:Tind; t:Integer;
Begin For i:=1 To n-1
Do Begin imin:=i; { }
For k:=i+1 To n
Do If M[k]<M[imin]
Then imin:=k;
{ }
t:=M[i]; M[i]:=M[imin]; M[imin]:=t;
End;
End; {SortVibor}
Procedure SortObmen(n:Tind; Var M:Tmas);
{
}
Var i,k:Tind; t:Integer;
Begin For k:=n DownTo 2
Do For i:=1 To k-1
{ }
Do If M[i]>M[i+1] { }
Then Begin
{ }
t:=M[i]; M[i]:=M[i+1]; M[i+1]:=t;
End;
End; {SortObmen}
Procedure SortObmenF(n:Tind; Var M:Tmas);
{
}
Var i,k:Tind; flag:Boolean; t:Integer;
Begin
k:=n;{ }
Repeat flag:=FALSE; { }
For i:=1 To k-1
Do If M[i]>M[i+1]
90

Then Begin
{ }
t:=M[i]; M[i]:=M[i+1]; M[i+1]:=t;
flag:=TRUE; { }
End;
k:=k-1;
Until (Not flag) Or (k=1);
End; {SortObmenF}
Procedure SortVstav(n:Tind; Var M:Tmas);
{
}
Var i,j,k:Tind; t:Integer;
Begin For i:=2 To n
Do Begin t:=M[i]; { }
j:=1;
{ }
While (j<i) And (M[j]<=M[i])
Do j:=j+1;
For k:=i-1 DownTo j
Do M[k+1]:=M[k]; { }
M[j]:=t;
{ }
End;
End; {SortVstav}
Procedure OutMas(n:Tind; name:String; Var M:Tmas);
{ }
Var i:Tind;
Begin Write(' ',name,': ');
For i:=1 To n
Do Write(M[i],' '); WriteLn;
End; { OutMas }
Const MasA:Tmas=(10,9,8,7,6,5,4,3,2,1);
MasB:Tmas=(19,17,15,13,11,9,7,5,3,1);
MasC:Tmas=(20,18,16,14,12,10,8,6,4,2);
MasD:Tmas=(1,10,2,9,3,8,4,7,5,6);
Begin SortVibor(R,MasA); OutMas(R,'MasA',MasA);
SortObmen(R,MasB); OutMas(R,'MasB',MasB);
SortObmenF(R,MasC); OutMas(R,'MasC',MasC);
SortVstav(R,MasD); OutMas(R,'MasD',MasD);
ReadLn;
End.

91

 2
Program SortStrMatr;
{ }
Uses Crt;
{ }
Const R=10;
Type Tind=1..R;
Tvect=Array[Tind] of Integer;
Tmatr=Array[Tind] of Tvect;
{$R+}
Procedure InMatr(kstr,kstb:Tind;Var M:Tmatr);
{ }
Var i,j:Tind;
Begin Writeln(' :');
For i:=1 To kstr
Do Begin For j:=1 To kstb
Do Read(M[i,j]);
ReadLn;
End;
End;{InMatr}
Function NStbMin(kstr,kstb:Tind; Const M:Tmatr):Tind;
{ }
Var i,j:Tind; min:Integer;
Begin min:=M[1,1]; NStbMin:=1;
For i:=1 To kstr
Do For j:=1 To kstb
Do If M[i,j]<min
Then Begin min:=M[i,j]; NStbMin:=j;
End;
End;{NStbMin}
Procedure SortMatr(kstr,nstb:Tind; Var M:Tmatr);
{ }
Var i,k,imax:Tind; StrM:Tvect;
Begin For i:=1 To kstr-1
Do Begin imax:=i;
For k:=i+1 To kstr
Do If M[k,nstb]>M[imax,nstb]
Then imax:=k;
StrM:=M[i]; M[i]:=M[imax]; M[imax]:=StrM;
End;
End;{SortMatr}

92

Procedure Okno(x1,y1,x2,y2,cf,ct:Byte);
{ }
Begin Window(x1,y1,x2,y2); { }
TextBackGround(cf); { }
TextColor(ct);
{ }
ClrScr;
{ }
End;{Okno}
Procedure OutMatr(kstr,kstb:Tind; Const M:Tmatr);
{ }
Var i,j:Tind;
Begin For i:=1 To kstr
Do Begin For j:=1 To kstb
Do Write(M[i,j]:4);
WriteLn;
End;
End;{OutMatr}
Var N,M,NStb:Tind; Matr:Tmatr;
Begin Okno(1,1,80,25,0,15);
{ }
Write(' ? '); ReadLn(N,M);
Okno(1,6,38,20,2,15);
{ }
InMatr(N,M,Matr);
{ }
NStb:=NStbMin(N,M,Matr);{ }
SortMatr(N,NStb,Matr); { }
Okno(40,6,80,20,3,15); { }
WriteLn(' ');
OutMatr(N,M,Matr);
ReadLn;
End.

93

7

, ,
.


.

.
.
, , ,
, :
- ;
- ;
- ( );
- .
:
- ( );
- ( );
- ;
- , (
[1], ):




- ;
- .


, 0
10

94

1

( )
.
.
.
, .

2


.

- ,
- (1% ),
- .

.

3


.

- ,
- , :
( - )*13%
,
,
- .

.

95

4


. .

.
.

5


. .

.
, .

6

.
,
.

7

.
,
.

8


.
,
, .
96

9


. .

.
, .
10


, ,
.

(
).
.

97

8
1. . .
. .
2. . .
. .
3. . ,
, .
4. .
. , . .
5. . .
. .
6. . ,
. .
7. . .
. .
8. . .
.
9. .
. .
10.
. . .
11. . .
. . .
.
12. .
. .
.
.
13. . . .
. .
14. . .
, . .
15. .
-, - , -.
16. :
.
17. :
.
18. .
: , . .

98

19. . , ,
, .
: .
20. .
. .
21. . .
.
22. . .
. . .
23. :
, ,
.
24. .
25. . .
. . .
26. :
.
27. :
. ,
.
28. . .
. . .
. .
29. . .
. . .
30. :
.
31. . , . .
. .
.
32. . . .
.
33.
.
34.
.
.
35. . . .
. .
. .
36.pp .
.
37. . .
.
99

38. . , ,
, .
.
39. .
.
40. .
.
41.. . . .
.
42. .
.
43. :
, , ( , ).
44. :
, , .
45.
.
46. . .
47. . .
48. . .
49. . .
50. . .
51. . ,
. .
52. . ,
. .
53. . ,
. .
54. .
. . .
55. .
.
56.

. System: .
57. Crt. . .
. .

100

9 -
9.1
)
1. .. . . . .:
. 1999 . - 280.
2. .., .. Turbo Pascal
7.0. : , .: , 2000 . 496c.
3. .. 7.0. . . .:
, 2000 . - 616.
)
1.
..,

..,

..

. : , 1997 . 368.
2. .. Turbo Pascal . .: . , 2000 .
- 256.
3. . / . ..
.: , 2002 . 336.
9.2
1. 19.701-90 , , .
.
2. 19.101-77 .
3. 19.106-78 ,
.
4. 19.202-78 .
.
5. 19.401-78 .
.
6. 19.402-78 .
.
7. 19.502-78 .
.
8. 7.32-2001 ,
. - .

101

102

-

44

44.2201.03

-
2003 .

103

-

44

44.2201.01

-
2003 .

104

1.
2.
3.
3.1.
3.2.
3.3.
3.4.
3.5.
3.6.
3.7.
4.
4.1.
4.2.
4.3.
4.4.
4.5.
4.6.

105

-

44

44.2201.01

-
2003 .

106