Вы находитесь на странице: 1из 184

. .

-
-
2011

681.3.06(075.3)
32.973.26721
12
12

. .

-. . .: -, 2011. 184 .: . ()

ISBN 978-5-9775-0621-2

- -2011, -2010 , . , . .
.

681.3.06(075.3)
32.973.26721

:

.
.

02429 24.07.00. 30.12.10.


60901/8. . . . . 23.
2000 .
"-", 190005, -, ., 29.
-
77.99.60.953..005770.05.09 26.05.2009 .
.

" ""
199034, -, 9 , 12

ISBN 978-5-9775-0621-2

. ., 2011
, "-", 2011


, , , .
, 21 . , . , , ,
.
-
. , , ,
, . !
-. "" -, :
( ),
2011 (http://www.fipi.ru/view/sections/217/docs/514.html), .
, . ,
.
"". ,
. !
, , . , . , ,
.
old_matros@mail.ru.
!

,


, , ,
.

 :

1 , "0", "1".
1 = 8 .
1 (, ) = 1024 .
1 (, ) = 1024 = 210 .
1 (, ) = 1024 = 220 .
1 (, ) = 1024 = 230 .
 .
ASCII , 8 ( ,
, ).
KOI8-R ( -8) , 8 .
Unicode , 16 ( 2 ).
 .
, -. .


2-2011

20 , 16- Unicode, 8- -8.



1) 320 ; 2) 20 ; 3) 160 ; 4) 20 .

.
:
16 = 2 , , 20 2 = 40 .

:
8 = 1 , 20 1 = 20 .
:
40 20 = 20 .
: 4.

5-2011

,
, , , ( ) : -00, -11, -010,
-011. : . . .
?
1) 71013; 2) DBCACD; 3) 7A13; 4) 31A7.

.
, :
011 11 010 00 010 011.
(. . " ..." 3). :
0111 1010 0001 0011.
:
7 1 3.
: 3.

10 1.
!

7-2011

Windows XP,
"A153B42FB4" . "4" "B52" , :
1) ABFB52; 2) AB42FB52; 3) ABFB4; 4) AB52FB.

.
, ! 34 , ...
, ...
4 52. ( , ,
?)
A153B42FB4 A153B522FB52.
:
A153B522FB52 ABFB52.
: 1.

B1-2011


, ( ).
,
( )?

.
, ? 3, () 4.
:
N = XY,
N , X ( 3 ), Y ( 4).
N = 34 = 81.
: 81.


1-2008

, 40 , 320 ,
40 . ?
1) ASCII Unicode; 3) -8 Unicode;
2) Unicode ASCII; 4) -8 ASCII.

1-2009

, 16-
Unicode, 8- -8. 480 . ?
1) 30; 2) 60; 3) 120; 4) 480.

11-2010

,
"", "", "" "", : "" 00,
"" 11, "" 010, "" 011. :
"". .
:
1) AD34; 2) 43DA; 3) 101334; 4) CADBCD.

12-2010

, , SMS-: " 3, 1, 8, 2, 6 5 2, ". ,


:
1) 3, 1; 2) 1, 1, 3; 3) 3, 1, 3; 4) 3, 3, 1.

B1-2009

.
("", "" "").
,
18 ?

B1-2010

. ?


1.1
Internet Explorer ,
16- Unicode, 8- -8.
720 . ?
1) 120; 2) 60; 3) 720; 4) 90.

10

1.2
70 , 16- Unicode, 8- KOI8-R. :
1) 70 ; 2) 70 ; 3) 140 ; 4) 490 .
.

1.3
"|" "".
.
, , 666, ?
1) 8; 2) 10; 3) 12; 4) 13.
.

11

1.4
512 . ,
2 ?
1) 8; 2) 16; 3) 32; 4) 64.
.

1.5
"" 24 8 , .
, ? ,
!
1) 5; 2) 6; 3) 7; 4) 8.
.

1.6
, 32 Unicode ( )?
1) 1 024; 2) 2 048; 3) 4 096; 4) 8 192.
.

12

1.7
0, 1, 2 3. . ?
1) 16; 2) 80; 3) 200; 4) 1024.
.

1.8
Unicode 16 . , ( ):
*6?(&FF)777+@
1) 18 ; 2) 36 ; 3) 54 ; 4) 72 ?
.

1.9
4,5 .
2304 . ?
1) 65 536; 2) 4096; 3) 512; 4) 16.
.


. 1. 2011 .


16-2011

7
( 22 )
.
( ).
,
50 .
1) 350 ; 2) 300 ; 3) 250 ; 4) 200 .

.
, 22 10 32 .
32 ( ) 25 = 32
5 .
7 5 = 35 .
35 = 35 : 8 = 4,375 , " ".
4, 5 . , , ?
, 50 50 5 = 250 .
: 3.

6-2011


, 219
. ,

215 . ,
5
.
,
512 . ( )
?
, "" ""
.

14

.
,
! !
512 "" 219 /. ,
. 512 .
512 = 29 = 29 210 = 219 = 219 23 = 222 .
222 : 219 = 23 = 8 .

5 215 /.
5 .
5 10 , . . 512 . , :
5 = 10 222 .
?
10 222 : 215 / = 10 27 = 10 128 = 1280 , 8 512 . : 1280 + 8 = 1288 .
: 1288.


2-2009

119 . ,
, .
, ,
70 ?
1) 70 ; 2) 70 ; 3) 490 ; 4) 119 .

2-2010

7 . 18
.
, .
,
60 .
1) 240 ; 2) 300 ; 3) 360 ; 4) 420 .

15

7-2009

ADSL- 128 000 /c.


625 .
.

7-2010


,
256 /. , 32 /. , 5 .
,
512 . ( )
?
, "" ""
.

16


2.1
549 .
, , . , , 324 ?
1) 405 ; 2) 1620 ; 3) 3240 ; 4) 5490 .
.

2.2
7
( 26 ), ,
"!", "?", "#". ( ).
, 100 ?
1) 300; 2) 400; 3) 500; 4) 600.
.

2.3
- 2 . 2 048 . 256 , 128 . 16 .
, 360 5 .
- , ?

1)
2)
3)
4)

17

. 2928 .
. 1928 .
. 2198 .
. 2008 .

2.4
- 8 16 . 512 , 8 .
?
1) 32 ; 2) 45 ; 3) 64 ; 4) 80 .
.

2.5
"Sounder Crike" 4 .
800 . -
512 , ?
1) 5; 2) 6; 3) 7; 4) 8.
.

18

2.6
160 .
) , 1024 , 128 ,
64 , (
)?
) , 5 , ( ) , ?
1) 10 240 512 ;
2) 16 320 784 ;

3) 20 480 1024 ;
4) 30 650 1648 .

2.7
16 /. 20 .
( , .)
) ?
) ( ) , 1
, , , 5 1 ?
1) 4,82 164 .; 3) 2,48 96 .;
2) 3,24 138 .; 4) 2,34 68 .
.

19

2.8
ADSL- 2 048 000 /c.
2 . .
.

2.9
ADSL- 2 048 000 /c. 125 . .
.

2.10
51 200 . .
64 . ?
.

20

2.11

65 536 16. , ?
.

2.12
256- 2400 .
?
.

, , , , , ,
, (
"" ""),
.

 ,

: , .
:
"0" 0002
"4" 1002
"1" 0012
"5" 1012
"2" 0102
"6" 1102
"3" 0112
"7" 1112
:
"0" 00002
"8" 10002
"1" 00012
"9" 10012
"2" 00102
"10 A" 10102
"3" 00112
"11 B" 10112
"4" 01002
"12 C" 11002
"5" 01012
"13 D" 11012
"6" 01102
"14 E" 11102
"7" 01112
"15 F" 11112


1-2011

= A716, B = 2518. C, , A < C < B?


1) 101011002;
3) 101010112;
2) 101010102;
4) 101010002.

.
, . /:

22

A716 = 1010 01112.


2518 = 010 101 0012 = 1010 10012.
, 0111 1001 1000.
: 4.

4-2011

578 4616?
1) 3518; 2) 1258; 3) 5516; 4) 7516.

.
, ,
, .
1- .
4616 . .
4616 = 0100 01102 = 1 000 1102 = 1068.
578 + 1168 = 1658 = 001 110 1012 = 0111 01012 = 7516.
: 4.
2- .
, .
578 = 5 81 + 7 80 = 4710.
4616 = 4 161 + 6 160 = 7010.
4710 + 7010 = 11710.
11710 = 1658 = 7516.
: 4.

4-2011

18 30. .

.
, ,
:
30p = 3 p1 + 0 p0 = 1810.
3p = 18.
p = 6.
: 6.

B3-2009

,
25, 11.

.
1- . .
25 4 .

23

,
, 4.
, .
.
, ,
1 25. ,
0, 1, 2, 3. -!

4,
, 3 , . 10. .

10

15

33

11

16

100

12

17

101

13

18

102

20

19

103

21

20

110

10

22

21

111

11

23

22

112

12

30

23

113

13

31

24

120

14

32

25

121

: 5, 21.
2- . .
, , 11 .
. . , , 11?
, , 11, 111, 211, 311. .
,
1 25.
114 = 1 41 + 1 40 = 4 + 1 = 510 .
1114 = 1 42 + 1 41 + 1 40 = 16 + 4 + 1 = 2110 .

24

, 2114 .
: 5, 21.


1-2010

= 9D16, B = 2378. C, , A < C < B?


1) 10011010;
3) 10011111;
2) 10011110;
4) 11011110.

ASCII:

3-2010

49

53

65

66

81

97

98

31

35

41

42

51

61

62

"q"?
1) 71;
2) 83; 3) 1; 4) 3.
.

25

X Y, :
X = 1101112
Y = 1358
:
3) 100100112;
1) 110101002;
4) 100101002.
2) 101001002;

4-2010

11-2010

,
"", "", "" "", : "" 00,
"" 11, "" 010, "" 011. :
"". .
.
1) AD34;
3) 101334;
2) 43DA;
4) CADBCD.

B3-2010

49 100. .

26


3.1
: k = 10000012; l = 1038. m, ,
k < m < l?
1) 6510; 2) 6610; 3) 6710; 4) 6810.
.

3.2
= 216, = 448. .
1) 11 100 100; 2) 11 101 110; 3) 11 000 110; 4) 11 111 100.
.

3.3
= C416, = 1348.
.
1) 1210; 2) 1220; 3) 1200; 4) 1230.
.

27

3.4
= 10011012, = 3334. .
1) 214;
2) 314; 3) 423; 4) 505.
.

3.5
25910?
1) 4; 2) 3; 3) 2; 4) 1.
.

3.6
EDA16?
1) 3; 2) 2;
3) 1; 4) 0.
.

28

3.7
, , 5178?
1) 3; 2) 2; 3) 1; 4) 0.
.

3.8
:
1) 1002; 2) 1005; 3) 10010; 4) 10016.
.

3.9

(. 3.1), , :
53414D4516
:
1) GAME; 2) SALE; 3) SAME; 4) SOME.
.

29

3.1

01000001

01001010

01010011

01000010

01001011

01010100

01000011

01001100

01010101

01000100

01001101

01010110

01000101

01001110

01010111

01000110

01001111

01011000

01000111

01010000

01011001

01001000

01010001

01011010

01001001

01010010

3.10
A, B , ( = 2110, = 538
= 116). :
1) 10110112; 2) 10010112; 3) 11010112; 4) 11011012.
.

3.11
, ,
( = 1110001112, = 6538 = DA16). :
1) 1000; 2) 1100; 3) 1200; 4) 1300.
.

30

3.12
1000p , p .
120 110 . ?
1) 2; 2) 3; 3) 4; 4) 5.
.

3.13
100k , 33k Pentium 4, 22k Pentium III,
16k AMD 17k Mac, k .
?
1) 8; 2) 9; 3) 10; 4) 11.
.

3.14
?
1) 53618; 2) 01234; 3) 1614;
.

4) 7617.

31

3.15
, .
2 .
. ?
1) 30;
2) 45; 3) 59; 4) 99.
.

3.16
, ,
. .
. : 338, 2410, 116. :
1) 11 0112; 2) 11 1012; 3) 11 0002; 4) 11 1102.
.

3.17
:
1258 + 111012 A216 14178.
.
.

32

3.18
p , :
33m5np + 2n443p = 55424p.
, m
.
.

3.19
( ) 10101, , .
, ( )
.
.

3.20
:
356 + 243 = 632?
.

33

3.21
,
, 32 5.
.

True () False
(), , ( , ), ( ,
), ( , ), (),
, , , , , .

"", , ,
( & B). "", : & B .
.


. 4.1.
4.1
A

AB

AB

AB

:
1. .
2. .
3. .
4. .
(
):
1. () (
, ):
XY=YX
XY=YX

2. ()
 :
(X Y) Z = X (Y Z)
 :
(X Y) Z = X (Y Z)
, ( ), .
3. ()
 :
(X Y ) Z = (X Z) (Y Z)
 :
(X Y) Z = (X Z) (Y Z)
:
1. ( ):
X=X
2. ( )
 :


X Y = X Y
:

X Y = X Y
3. ():
XX=X
XX=X
, .
4. :
X1=1
X0=X
X1=X
X0=0
5. :
X X =0
6. :

X X =1
7.
 :
X (X Y ) = X
 :
X (X Y ) = X
8. ()
 :
(X Y ) (X Y) = Y


:
(X Y ) (X Y) = Y

35

36

9. ( ):
(X Y ) = (Y X)


9-2011

F
: X, Y, Z. F:
X

F?
1) X Y Z;
3) X Y Z;
2) X Y Z;
4) X Y Z.
.
, :
1. : X Y Z = 0 1 1 = 0. .
: X Y Z = 1 1 1 = 0. .
2. : X Y Z = 0 1 1 = 0. .
: X Y Z = 1 1 1 = 0. .
3. : X Y Z = 0 1 1 = 1. . ,
, .
4. : X Y Z = 0 1 1 = 0. .
: X Y Z = 1 1 0 = 1. .
X Y Z = 0 0 1 = 1. !
: 4.

10-2010

,
A (B C):
1) A B C;
3) A B C;
2) A (B C);
4) A B C?

.
(. . " "
).
A (B C) = A (B C).
: 2.

37

:
( )
?
1) ;
3) ;
2) ;
4) .

15-2011

.
, ,
. ,
. . . ,
: 1 0. , .
. ,
( ? , !).
: 1.

((J K) (M N L)) ((J K) (M N L)) (M J) = 1,
J, K, L, M, N ?
J, K, L, M
N, . .

B10-2011

.
. 25 = 32.
. . , J K 0, , , L, M, N, 0,
(J K) (M N L) , , .
.
!
4.2
J

38

4.2 ()
J

. .
: 8.


7-2010

:
( ) ?
1) ;
3) ;
2) ;
4) .

8-2010

:
(A B) C?
1) A B C;
3) (A B) C;
2) A B C;
4) (A B) C.

39

F:

9-2010

F?
1) X Y Z;
3) X Y Z;
2) X Y Z;
4) X Y Z.
.

B4-2010

:
J K L M (N N) = 0,
J, K, L, M, N ?
J, K, L, M
N, .
.

40


4.1
Z :
(( Z > 3) ( Z = 1) ( Z = 2)) ( Z > 4) ?
1) 1;

2) 2;

3) 3;

4) 4.

4.2
Z :
( Z < 3) (( Z > 0) (( Z = 1) ( Z = 2))) ( Z > 3) ?

1) 1;

2) 2;

3) 3;

4) 4.

4.3
Z :
(( Z > 3) ( Z < 1)) ( Z = 2) ?

1) 0;

2) 1;

3) 2;

4) 3.

4.4
:
( )?
1) ;
2) ;
3) ;
4) .
.

4.5
:
( ) ?
1) ;
2) ;
3) ;
4) .
.

41

42

4.6
:
( ) ?
1) ;
2) ;
3) -;
4) .
.

4.7
:
( A B) C ?

1) A B C;
2) A B C;
3) A B C ;
4) A B C .
.

4.8
, :
(A B C)?
1) A B C;
2) A B C;
3) A B C;
4) A B C.

4.9
, :
( B C)?
1) A B C;
2) A B C;
3) A B C;
4) A B C.
.

4.10
, :
A (B C)?
1) A B C;
2) A (B C);
3) A B C;
4) A B C.
.

43

44

4.11
:
( A A) (C C ) ?

1)
2)
3)
4)

;
;
True;
False.

4.12
F :
, , .
F:

F?
1) ;
2) ;
3) ;
4) .
.

45

4.13
F :
, , . F:
A

F?
1) ;
2) ;
3) ;
4) .
.

4.14
D :
A, B, C. D:

D?
1) C B A ;
2) B C A ;
3) (A B) C;
4) A B C .

46

4.15
N :
K, L, M. N:
K

N?
1) K L M ;
2) L M K ;
3) M ( L K ) ;
4) M K L .
.

4.16
, :
F = (X Y ) (Y Z).
000 111.
, , .
, ?
1) 8; 2) 2; 3) 4; 4) F1.

47

. . . , . .
. .


11-2011

()
( ) ( )
.
( )? (
.)

600

15 300

900

23 800

300

7500

1200

31 200

100

2150

500

12 000

50

1100

250

5500

100

2350

400

10 000

50

1200

200

4800

200

6000

200

6300

100

3100

350

10 500

1000

25 800

2000

52 100

500

12 900

2000

52 000

1) ;
2) ;
3) ;
4) .
.
, . ,
, . ? , . ,
?
, , . .

49

, ( ):
1) "" 25800 : 1000 = 25,8 ;
2) "" 52100 : 2000 = 26,05 ;
3) "" 12900 : 500 = 25,8 ;
4) "" 52000 : 2000 = 26 .
""!
: 2.

12-2011

(I, II III),
: (),
(), () (). 1 (. 5.1)
. 2 ,
( ) .
2)

1)
45

II

40
35
30
25
20
15

III

10
5
0

. 5.1

?
) III.
) II.
) I.
) II.
1) ;
2) ;
3) ;
4) .






.
:
30%;
20%;
10%;
40%.

50

 I 12,5 %;
 II 25%;
 III 62,5%.

, 10%,
62,5% .
, . . 30%, 25% .
, . . 30% ,
12,5%.
, , , . .
.
: 1.


16-2009

=(B1:B2) 5.
B3, =(B1:B3) 3?
1) 8; 2) 2; 3) 3; 4) 4.

17-2009

(. 5.2) (), (), () .

. 5.2

51

1)

3)

2)

4)

16-2010

() ( ) ( )
12- 15- .
100 ?
12

13

14

15

11

9989

2134

9789

2056

9234

2198

9878

2031

38 890

8419

490

101

987

215

487

112

978

203

2942

631

1076

147

2111

297

4021

587

1032

143

8240

1174

998

151

2054

299

3989

601

1023

149

8064

1200

1)
2)
3)
4)

11;
;
6;
.

52

17-2010

: (), ()
().
. 1 (. 5.3)
, 2
. .

1)

2)

. 5.3

:
) ;
) ;
) ;
)
?
1)
2)
3)
4)

;
;
;
.

53


5.1
?
1) A1\B3;
2) A1+ B3;
3) A1:B3;
4) A1-B3.
.

5.2
:

=A1+B1

) :
C1 D1

D1
?
1) =2+B2;
2) =A1+C1;
3) =B1+C1;
4) =C1+D1.
.

54

) :
C1 D2

D2?
1) =C1+D1;
2) =B2+C2;
3) =C2+D2;
4) =A2+B2.
.

) :
C1 2

2?
1) =1+1;
2) =2+2;
3) =2+B2;
4) =B2+C2.
.

5.3
:

0,5

1,5

9,5

=1+2/5

B2, A1 2,
A2 7?
1) 2; 2) 3; 3) 4; 4) 5.
.

55

5.4
D3 =E5-$C$2. , D3 A2?

"$" .

1) =B4-$C$2;
2) =F2-$C$1;
3) =F2-$F$2;
4) =C1-$C$2.
.

5.5
:

=A1/2

=B1+B2

=B1/2

=B3B2

=A2+2

=C1B2

=A2+A4

=B3A1

(. 5.4)
C1:C4. .
.

56

5
1)

3)
4

2
1

4)

2)
4

. 5.4


B8-2011

( )
.
"". :
, ( i- i- ), .
4 , :
(1) A
(2) AAB
(3) AABAABC
(4) AABAABCAABAABCD
( ):
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z.
: , n-
2n 1 5, .
n = 8.

.
. 1, 3, 7, 15. S = 2n 1, S , n .
, . S8 = 28 1 = 255.
, ,
, ABCDEFGH. , , 127 .
, .
2n 1 5 = 27 5 = 123.
1

... .

58

. ( 127 ) 7 :

121

122

123

124

125

126

127

: .


12-2009

, ,
. A, B, C.
B, D, C, . , C, E, B, .
?
1) ;
3) D;
2) ;
4) BCB.

B6-2008

7 , 0 6. 0 ().

( i- i).
4 , :
(0) 0
(1) 001
(2) 0010012
(3) 001001200100123
124- ( )?

59

B8-2009

( )
. "".
:
, ( i- i- ),
.
4 , :
(1) A
(2) BAA
(3) CBAABAA
(4) DCBAABAACBAABAA
( ):
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z.
, 126-
132- ( ).

60

B8-2010

( ) .
"".
:
, ( i- i- ), .
4 , :
(1) A
(2) AAB
(3) AABAABC
(4) AABAABCAABAABCD
( ):
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z.
, 117-
122- ( ).


6.1
5 , "P", "R",
"O", "B", "A". :
 "P";
 , ;
 .
3 , ?
1) 1; 2) 2; 3) 3; 4) 4.

61

6.2
.
"". : ,
, ( i- i- ).
4 , :
(1)
(2) B
(3) BBC
(4) BBCBBCD
8- (, , I, J, ...)?
.



6-2011

08:00

:

07:50

09:05

08:55

10:05

09:05

10:15

10:00

11:10

10:15

11:30

10:45

12:00

11:05

12:15

11:10

12:25

12:15

13:25

12:45

13:55

,
.
1) 09:05;
2) 12:15;
3) 12:25;
4) 13:25.
.
.
1. . , 09:05, . 10 , ...
2. . 11:30, ...
...
3. . 10.45,
12.15 13.25 . !
: 4.

13-2011

63

. .

ID

""

D01

. , . , 15

""

D02

. , . , 17

""

D03

. , . , 8

""

D04

. , . , 6

""

D05

. , . , 28

""

D06

. , . , 4

001

D01

01002

300

5/01/2009 .

002

D02

01002

100

5/01/2009 .

003

D06

01002

200

5/01/2009 .

004

D01

02002

20

5/01/2009 .

005

D02

02002

30

5/01/2009 .

006

D02

01003

20

6/01/2009 .

, 24 .

01001

24

4, 500

01002

10

, 1000 .

01003

48

20

02001

12

60

02002

100

2-

02003

48

5 2009 .?
1) 100;
2) 200;
3) 500;
4) 1500.

64

.
. .
, ID D02 D06.
, 01002, 5 .
, 5 2009 (01002)
: D02 100 , D06 200 .
300 , 5 , 1500.
: 4.


10-2009

"", "",
"" "" . :

06:20

08:35

10:25

12:35

11:45

13:30

12:15

14:25

12:45

16:35

13:15

15:40

13:40

17:25

15:30

17:15

17:35

19:30

19:40

21:55

"" (0:00). , "".


1) 15:40;
2) 16:35;
3) 17:15;
4) 17:25.
.

65

14-2009

82

56

46

32

70

43

62

45

74

23

54

74

68

75

83

71

63

56

82

79

33

25

74

38

46

18

92

83

28

61

" = '' > "?


1) 5;
2) 2;
3) 3;
4) 4.
.

10-2010

08:00
:

10:10

11:15

10:15

12:35

10:20

11:15

10:35

11:40

11:25

12:30

11:40

12:40

,
.

66

1)
2)
3)
4)

12:25;
12:30;
12:35;
12:40.

14-2010

?
1) 5;
2) 2;
3) 3;
4) 4.


7.1
"", "", "" ""
.
:

67

00:15

02:25

07:35

08:50

07:45

11:10

09:20

10:35

10:55

12:20

12:20

14:15

14:25

15:35

15:45

18:50

16:10

17:25

17:55

19:25

"" (0:00). ,
"".
1) 07:45; 2) 17:25; 3) 18:50; 4) 19:25.
.

7.2
:

(/)

()


100

()

()

82

56 000

15

32 000

10

43

62 000

12

74 000

54

74 000

10

75 000

63

56 000

13

82 000

12

33

74 000

14

38 000

20

83 000

18

28 000

18

:
" = '' ( = '' < 70000)"?
1) 5; 2) 2; 3) 3; 4) 4.

68

7.3
( , , ,
, ( 3 , 1, 0)).

10

27

21

12

27

18

11

25

17

Doom

10

18

15

12

10

31

25

10

26

18

11

19

14

:
( > 9 < 2) ( < 2)?
1) 1; 2) 2; 3) 3; 4) 4.
.

, , , , (), , .
, ,
. ( DOS, .)


3-2011

.
, , :
 "?" ( )
;
 "*" ()
, "*" .
, :
1234.xls
23.xml
234.xls
23.xml
1) *23*.?x*
2) ?23?.x??
3) ?23?.x*
4) *23*.???

.
.
, , , . ?
23.
, , 2 3 (. .
). 1 4. 1
"x" . 4, 3 .
: 4.

70


13-2009

, :
?hel*lo.c?*
1) hello.c
2) hello.cpp

3) hhelolo.cpp
4) hhelolo.c

13-2010

, :
?ba*r.?xt
1) bar.txt
2) obar.txt

3) obar.xt
4) barr.txt


8.1
: ??p*.a??
1) pepsi.a1
2) tupik.abc
3) sport.arj
4) stupor.avc

71

8.2
C: : QUESTS ANSWERS.
QUESTS PROBLEM, ANSWERS : ANSWER1 ANSWER2. PROBLEM asc.txt
ANSWER1, abc.txt. abc.txt?
1) C:\QUESTS\PROBLEM\abc.txt;
2) C:\QUESTS\ANSWER1\abc.txt;
3) C:\ANSWER\ANSWER1\abc.txt;
4) C:\ANSWERS\ANSWER1\abc.txt.
.

8.3
.doc. .doc,
Z:\\IBM\\.doc. ,
?
1) Z:\\IBM\\;
2) Z:\;
3) Z:\\IBM\;
4) Z:\.

72

RGB-

. . RGB- .

RGB-










#000000 .
#FFFFFF .
#FF0000 .
#00FF00 .
#0000FF .
#FFFF00 .
#00FFFF ( #80 ).
#FF00FF ().
, ...


14-2011

-

24- RGB-
:
bgcolor="#",

XX

XX

XX

, <body

bgcolor="#747474">?

1) ;
2) ;

3) ;
4) .

.
(), , FF (), , , -.
: 1.

74


15-2010

Web-

24- RGB-.
, <body bgcolor="#00FF00">?
1) ;
3) ;
2) ;
4) .
bgcolor="#",


9.1
- bgcolor = "#",

24- RGB-. , <body
bgcolor="#DDDD00">?
1) ;
3) ;
2) ;
4) .
.

10

, . . . .


18-2011

"", "" , :

"" :
, , , .
, "":

<> , , .
"" , , .
(. 10.1) , , , "" , ?

< >
< >
< >
< >

1)
2)
3)
4)

1;
2;
3;
4.
. 10.1

76

10

.
, :
.
,
.
, 6. , , . , ... . 1 !
6. , , 5 . , 5. ,
, 6, , , , . . 6. ! !
. . 36 , , 6, 5 D3.
, , . < >, "" ,
, . . . 36
11! , 25 !
: 3.

B3-2011

"" , :
1. 1.
2. 3.
, "" 1,
, .
2 26, 6 , .
(, 21211
3
1
3
1
1

1 14.)
.
, , , 2 26
? 13 2. 24 .
24, , 8, 6,
6 . : 211211.
: 211211.


B5-2009

"" , :
1. 3.
2. 4.
, "" 3,
, 4. -

77

3 57, 6 , . (, 21211 ,
:
4
3
4
3
3

2 50.)
.

18-2010

, 18-2011.
(. 10.2) , ,
, ""
, ?

< >
< >
< >
< >

1) 1;

2) 2;

3) 3;

4) 4.

. 10.2

78

10

B5-2010

""
, , , ,
. ""
:

,
"" .
.


10.1
c ,
:
1. 3.
2. 1.

79

3, 1. 2 25, 6 ,
. (, 12122 :
3
1
3
1
1

2 13.)
.

10.2
"" , . Fn ( n ), Bn ( n ), Rn
( n ) Ln ( n ).
, ""
, YESm ( ) NOm ( ), m :
F30L60F30L60F30L60F30R60B30R60B30
.

10.3
"" 1 (. 10.3).
, "",
"" , 4 8, 8. ""
"". : 1-2-3...

80

10
8
7
6
5
4
3
2
1
A

. 10.3

10.4
"", , 0,
(, "") 2 (,
"").
10. 99.
( 50):
.
(0 + 1 2 + 1 2 2 2 2 + 1 + 1 = 50.)
, .
.

81

10.5
. , , .
1, 0,
. ,
:
SSSWWWSWW
.

11

- ,
. , .


8-2011

c , a, b () .

a = 120

a := 120;

b = 100

b := 100;

a = a + b / 2

a := a + b / 2;

IF b < a / 2 THEN

if b < a / 2

c = b + a

then
c := b + a

ELSE
c = b + a / 2
ENDIF

else
c := b + a / 2;

a = 120;

a := 120

b = 100;

b := 100

a = a + b / 2;

a := a + b / 2

if (b < a / 2)

b < a / 2

c = b + a;

c := b + a
c := b + a / 2

else
c = b + a / 2;

1) c = 105;
2) c = 160;
3) c = 185;
4) c = 270.

83

.
. a b
a. :
a = 120 + 100/2 = 120 + 50 = 170.
: b ( 100) /2 (170 / 2 = 85),
a b, c b , . . ,
100 + 85 = 185.
: 3.

17-2011

A
0 10. , , , .

FOR i=0 TO 10

for i:=0 to 10 do
A[i]:=i-1;

A(i)=i-1

for i:=10 downto 1 do

NEXT i
FOR i=10 TO 1 STEP -1

A[i-1]:=A[i];

A(i-1)=A(i)
NEXT i

for (i=0;i<=10;i++)

i 0 10

A[i]=i-1;

A[i]:=i-1

for (i=10;i>=1;i--)

A[i-1]=A[i];

i 10 1 -1
A[i-1]:=A[i]

?
1) 9 9 9 9 9 9 9 9 9 9 9;
2) 0 1 2 3 4 5 6 7 8 9 9;
3) 0 1 2 3 4 5 6 7 8 9 10;
4) 1 1 0 1 2 3 4 5 6 7 8.

.
, . FOR, .
0 10 11 .

1 9.

84

11

A(i1), A(i)

10

A(9) = A(10) = 9

A(8) = A(9) = 9

A(7) = A(8) = 9

A(6) = A(7) = 9

A(5) = A(6) = 9

A(4) = A(5) = 9

A(3) = A(4) = 9

A(2) = A(3) = 9

A(1) = A(2) = 9

10

A(0) = A(1) = 9

(10) 9.
: 1.

B2-2011

a (. 11.1).

. 11.1

: := .
.
.
, .

85
a

a = b

a > b

56

77

56

21

35

21

14

21

14

: 7.


6-2009

, A
n:


k := 1

k = 1

k := 1;

FOR i = 1 TO n

for i := 1 to n do

i 1 n

c = A(i,i)

begin

c := A[i,i]

A(i,i) = A(k,i)

c := A[i,i];

A[i,i] := A[k,i]

A(k,i) = c

A[i,i] := A[k,i];

A[k,i] := c

NEXT i

A[k,i] := c

end

,
A[i,j] i , j , .
:
1) ;
2) ;
3) k- ;
4) k- .
.

86

11

5-2010

c ( ):

a = 100

a := 100;

b = 30

b := 30;

a = a b * 3

a := a b * 3;

IF a > b THEN

if a > b then

c = a b

c := a b

ELSE c = b a

else c := b a;

ENDIF

a = 100;

a := 100

b = 30;

b := 30

a = a b * 3;

a := a b * 3

if (a > b)

a > b c := a b
c := b a

c = a b;

else c = b a;

1) 20;

2) 70;

3) 20;

4) 180.

6-2010

A 0 10. ,
,
, :

FOR i = 0 TO 10
A(i) = i

for i := 0 to 10 do
A[i] := i;

NEXT i

for i := 0 to 10 do

FOR i = 0 TO 10

begin

A(10-i) = A(i)
A(i) = A(10-i)
NEXT i

A[10-i] := A[i];
A[i] := A[10-i];
end;

87


i 0 10

for (i = 0; i <= 10; i++)


A[i] = i;

A[i] := i

for (i = 0; i <= 10; i++)

i 0 10
A[10-i] = A[i];

A[10-i] := A[i]

A[i] = A[10-i];

A[i] := A[10-i]


?
1) 10 9 8 7 6 5 4 3 2 1 0;
2) 0 1 2 3 4 5 6 7 8 9 10;
3) 10 9 8 7 6 5 6 7 8 9 10;
4) 0 1 2 3 4 5 4 3 2 1 0.
.

B2-2010

b (. 11.2).

a := 256
b := 0

a=1

a := a / 2
b := b + a

. 11.2

88

11


11.1
m ,
m n () :

m = 6

m := 6;

n = 6 + 8 * m

n := 6 + 8 * m;

n = n / 2 * m

n := n / 2 * m;

1) n = 68;

m = 6;

m := 6

n = 6 + 8 * m;

n := 6 + 8 * m

n = n / 2 * m;

n := n / 2 * m

2) n = 42;

3) n = 162;

4) n = 362.

89

11.2
A 1 10.
, , , :

FOR i = 1 TO 10
A(i) = i - 1
NEXT i
FOR i = 1 TO 10

for i := 1 to 10 do
A[i] := i - 1;
for i := 1 to 10 do
A[i] := A[11-i];

A(i) = A(11-i)
NEXT i

?
1) 9 8 7 6 5 4 3 2 1 0;
2) 1 2 3 4 5 5 4 3 2 1;
3) 11 10 9 8 7 6 5 4 3 2;
4) 9 8 7 6 5 5 6 7 8 9.
.

11.3
, A n , ,
[1] :

pr = 1

pr := 1;

i = 1

i := 1;

WHILE (i <= n) AND ((A(i) < 0) OR (A(i) > 0))

while(i <= n) and ((A[i] < 0) or (A[i] > 0)) do

pr = pr * A(i)

begin

i = i + 1

pr := pr * A[i];

WEND

i := i + 1
end

90

11

pr :
1) A;
2) A;
3) A;
4) A A[1] .
.

11.4
, A n :

J = 1

j := 1;

FOR I = 1 TO N

for i := 1 to n do

IF A(I) > A(J) THEN J = I


NEXT I

if A[i] > A[j] then j := i;


m := j;

m = J

m ?
1) A.
2) A ( , ).
3) A ( ,
).
4) , A.
.

91

11.5
, M N k ( ):

M(1) = N(1)

M[1] := N[1];

FOR I = 2 TO k

for i := 2 to k do

N(I) = N(I-1) * M(I)


NEXT I

N[i] := N[i-1] * M[i];


w := N[k]

w = N(k)

w ?
1) N.
2) M.
3) M.
4) M, , N.
.

11.6

( W = 3)?

INPUT W

readln w;

FOR R = 1 TO W

for r := 1 to w do

PRINT "WAR"
NEXT R
IF R = W THEN GOTO 1
PRINT "SUNDAY"
1: PRINT "PEACE"

writeln('WAR');
if r = w then goto 1;
writeln('SUNDAY');
1: writeln('PEACE');

92

11

1)

2)

WAR
WAR
WAR
SUNDAY
PEACE

WAR
WAR
WAR
PEACE

3)

4)

WAR
WAR
WAR

WAR
WAR
WAR
SUNDAY

11.7
?

X = 13

x := 13;

Y = 17

y := 17;

Z = 2

z := 2;

2: IF Z >= 4 THEN GOTO 1

2: if Z >= 4 then goto 1;

PRINT X, Y, Z

writeln(x, y, z);

X = X 1

x := x 1;

Y = X + Y

y := x + y;

Z = Z + 1

z := z + 1;
goto 2;

GOTO 2

1: end.

1: END

1)

13 17 2
12 30 3
11 42 4

2)

13 17 2
12 29 3

3)

13 17 2
12 29 3
11 40 4

4)

13
12
11
10

17
29
40
50

2
3
4
5

93

11.8
?

X = 13

x := 13;

Y = 52

y := 52;

Z = 99

z := 99;
u := 100;

FOR U = 100 TO 1 STEP -2


IF U = X THEN PRINT U

1: if u = x then writeln(u);

IF U = Y THEN PRINT U

if u = y then writeln(u);

IF U = Z THEN PRINT U

if u = z then writeln(u);
u := u 2;

NEXT U

if u > 1 then goto 1;

1)

13
99

2)

13
52
99

3)

52

4)

52
2

11.9
a b :

a = 2007

a := 2007;

b = (a \ 100) + 100

b := (a div 100)+100;

a = b \ 10 a MOD 1000

a := b div 10 a mod 1000;

(\ MOD ,


)

{div mod ,


}

94

11

1)
2)
3)
4)

= 25; b = 20;
= 5; b = 120;
a = 120; b = 5;
a = 10; b = 120.
a
a

11.10
C . R . N ( , ):

1)
2)
3)
4)

N = R - (R \ C) * C

N := R - (R div C) * C;

N = R - (C \ R) * C

N := R - (C div R) * C;

N = (R \ C) * C

N := (R div C) * C;

N = (C \ R) * C

N := (C div R) * C;

11.11
5 5 :

95

for i := 1 to 5 do
for j := 1 to 5 do

FOR i = 1 TO 5
FOR j = 1 TO 5
F(i, j) = 2 * j i
NEXT j

F[i, j] := 2 * j i;

NEXT i

?
1) 4;
2) 6;
3) 8;
4) 10.
.

11.12
B(2, 7):
5

11

14

17

20

23

13

11

P
(. 11.3).

. 11.3

1) 98;

2) 99;

3) 100;

4) 101.

96

11

11.13
B(5, 5):
8

R :

S1 = 0

S1 := 0;

S2 = 0

S2 := 0;

FOR i = 1 TO 5

for i := 1 to 5 do

S1 = S1 + B(i, i)

begin

S2 = S2 + B(i, 6-i)

S1 := S1 + B(i, i);

NEXT i

S2 := S2 + B(i, 6-i)

R = S1 S2

end;
R := S1 S2

1) 5;

2) 7;

3) 9;

4) 11.

97

11.14
.
. .
:

S = 0
FOR I = 2 10 STEP 2
S = ...

s := 0;
i := 2;
1: s := ...;

NEXT I

i := i + 2;

PRINT S

if i <= 10 then goto 1;


writeln (s);

220. S = ... ( s := ...)?

1)
2)
3)
4)

S = (S + I) / 2

s := (s + i) / 2;

S = (I + S) * 2

s := (i + s) * 2;

S = S + I * I

s := s + i * i;

S = S * I

s := s * i;

11.15

m := 6
n := 1

n (. 11.4).
m=2

n := n + m
m := m 1

. 11.4

98

11

11.16
a (. 11.5).

a := 7
b := 16

b=1

b := b / 2
a := a + b

. 11.5

99

11.17
a (. 11.6).
a := 48
b := 99

a=b

a>b

b := b a

a := a b

. 11.6

12

(, -, , ).


B7-2011

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

.
, . . .
, ,
3, .
.
1. , , .
: , , , , , ,
. . , .
2. , , . : ,
, , , ... !
3. , , , .
. , , . :
, , , , , , ,
. -! ! , , .
: .

101


B6-2009

, 3 , ,
, , .
, , , , ,
. . ,
.
. : " . , ". : "
". : ", , ". , .
: " ", " ", "
". (, ,
, : .)

B6-2010

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

102

12


12.1
,
3 , , ,
, . , , , ,
, . ,
: " ?" " ?". : "". , .
: " ", " ", " ".
.

103

12.2
. ,
, ,
, .
? , .
(: 1 , 2 , 3 , 4 , 5 ), : 23415.
.

12.3
, .
, ""; ,
""; , "", . , . .
.

104

12

12.4
5 : , , , . 2
. 2 . , :
1) , ;
2) ;
3) ( )
;
4) ( );
5) ;
6) .
: ?
: ,
, , : .
.

12.5
, , .
, ,
.
1) : " , ".
2) : " , ".
3) : " , ".
4) , ,
, , .
?
,
. , , , ,
.

105

12.6
. , , .
, , . ,
.
.
.
, .
.
, , .
.
.
.
, , , , .
, , .
, , .
.
.
: ?
.

106

12

13

, HTML,
, .


B4-2011


(. 13.1). ,
IP-. "", "", ""
"". IP-.
, ,
, IP-.

. 13.1

.
"" ( ) , . . . , . "",
, "" ""
2.22222 2.2222.22. , "" . .2.222.32.
"" "". :
 222.222.222.32 ;
 2.22222.222.32 .

: .

B9-2011

"" "|", "" "&".



.

108

13

( )

7000

4800

4500

( )
& ?
, ,
, ,
.
.
, , , .
"" "" 4800 + 4500 = 9300.
| 7000, , & 9300 7000 = 2300.
: 2300.


B9-2009

IP-
. .
IP (. 13.2). "", "", "" "".
IP-.
, ,
, IP-.

. 13.2

B9-2010

109

. , IP-
(. 13.3). "", "", ""
"". IP-.
, ,
, IP-.

. 13.3

B10-2009

. , .
""
"|", "" "&".

1)

& &

2)

&

3)

( & ) |

4)

| |

110

B10-2011

13

. , .
"" "|", "" "&".
1)

| |

2)

&

3)

& &

4)

& & &


13.1
.
, .
"" "|", "" "&".

1)

2)

&

3)

4)

| |

111

13.2
. , .
1)

| |

2)

| | |

3)

& & &

4)

13.3
. , .
1

( & ) & ( | )

&

14




C1-2011

,
(x, y )
(. 14.1) ( ). .
y

y = x2 2

y=x

y = x

. 14.1

var x,y: real;

INPUT x, y

void main(void)

begin

IF y<=x THEN

{ float x,y;

readln(x,y);

IF y<=-x THEN

scanf("%f%f",&x,&y);

if y<=x then

IF y>=x*x-2 THEN

if (y<=x)

if y<=-x then

PRINT ""

if (y<=-x)

if y>=x*x-2 then

ELSE

if (y>=x*x-2)

write('')
else
write(' ')
end.

PRINT " "


ENDIF

printf("");
else

ENDIF
ENDIF

printf(" ");
}

END

:
1. x, y, .

113

2. , , .
( , .)
.
.
1. : x=2, y=2. ( (x, y), : y>x y>x.)
2. (, x=0):
if (y>=x*x-2) and (y<=x) and (x>=0) or (x<=0) and (y<=-x) and (y>=x*x-2) then
write('')
else
write(' ')

(, ):
if (y>=x*x-2 && (y<=x || y<=-x))
printf("");
else
printf(" ");

(, , ):
IF y >= x * x - 2 THEN
IF NOT (y > x AND y > -x) THEN
PRINT ""
ELSE
PRINT " "
ENDIF
ELSE
PRINT " "
ENDIF

, ,
( ) , .
- ,
, , (. ., , (x>=0) (x<=0) ).


C1-2009

, (x, y ) (. 14.2), . .
, (x, y ) (. 4.1), .
.

114

14
y
yy ==11

y = sin
sinxx
xx

. 14.2. 1-2009

var x, y: real;

IF y <= 1 THEN

void main(void)

begin

IF x >= 0 THEN

{ float x, y;

readln(x, y);

IF y >= SIN(x) THEN

scanf("%f%f", &x, &y);

if y <= 1 then

PRINT ""

if (y <= 1)

if x >= 0 then

ELSE

if (x >= 0)

if y >= sin(x) then

PRINT " "

if (y >= sin(x))

write('')
else
write(' ')
end.

printf("");

ENDIF
ENDIF

else
printf(" ");

ENDIF
END

:
1. x, y,
.
2. , , .
( , .)
.

C1-2010

115

, (x, y ) (. 14.3), . .
y

x2 + y2 = 22

x
x = 2

y = x

. 14.3. 1

var x, y: real;

INPUT x, y

void main(void)

begin

IF x*x + y*y >= 4 THEN

{ float x, y;

readln(x, y);

IF x >= 2 THEN

scanf("% f % f",&x,&y);

if x*x + y*y >= 4 then

IF y <= x THEN

if (x*x + y*y >= 4)

if x >= 2 then

PRINT ""

if (x >= 2)

if y <= x then

ELSE

if (y <= x)

write('')
else
write(' ')
end.

printf("");

PRINT " "


ENDIF

else
printf(" ");

ENDIF
ENDIF

END

:
1. x, y,
.
2. , , .
( ,
.)

116

14


14.1
, (x, y )
( ) . 14.4.
.

. 14.4

117

var x, y: real;

INPUT x, y

void main(void)

begin

IF y>=x THEN

{ float x,y;

readln(x,y);

IF y>=0 THEN

scanf("%f%f",&x,&y);

if y>=x then

IF y<=3-x*x THEN

if (y>=x)

if y>=0 then
if y<=3-x*x then
write('')
else
write(' ')
end.

if (y>=0)

PRINT ""

if (y<=3-x*x)

ELSE

printf("");

PRINT " "

else

ENDIF

printf(" ");

ENDIF
ENDIF

END

:
1. x, y, .
2. , , .
( , .)
.

118

14

14.2
, (x, y )
(. 14.5), . .

y
y=x

R1

3,5

R2

3,5
. 14.5

var x, y, z: real;
begin
readln(x,y);
z := (x-3.5) * (x-3.5) + (y-3.5) * (y-3.5);
if r2 * r2 <= z then
if r1 * r1 >= z then
if y >= x then
write('')
else
write(' ')
end.

INPUT x, y
z = (x-3.5) * (x-3.5) + (y-3.5) * (y-3.5)
IF r2^2 <= z THEN
IF r1^2 >= z THEN
IF y >= x THEN
PRINT ""
ELSE
PRINT " "
ENDIF
ENDIF
ENDIF
END

119

C
void main(void)
{ float x, y, z;
scanf ("%f%f", &x, &y);
z = (x-3.5) * (x-3.5) + (y-3.5) * (y-3.5)
if (r2 * r2 <= z)
if (r1 * r1 >= z)
if (y >= x)
printf ("");
else
printf " ";
}

:
1. x, y,
.
2. , , .
( , .)
.

15

,
. :
, , , , , .


C2-2011

30 .
0 1000.
, , . ,
.
, . , ,
.

const

N=30

N=30;

DIM A(N) AS INTEGER

var

DIM I, X, Y AS INTEGER

a: array [1..N] of integer;

DIM S AS SINGLE

i, x, y: integer;

FOR I = 1 TO N

s: real;

INPUT A(I)

begin

NEXT I

for i:=1 to N do readln(a[i]);

...

...

END

end.

#include <stdio.h>

A 30 .

#define N 30

I, X, Y.

void main(void)

S.

{int a[N];

1 30

int i, x, y;
float s;

A 1- 30-.

121

for (i=0; i<N; i++)

...

scanf("%d", &a[i]);
...
}

( ), . (
, , Borland Pascal 7.0) -.
, , , ,
.
.

x:=0;

X = 0

y:=0;

Y = 0

for i:=1 to N do

FOR I = 1 TO N

if (a[i] mod 2=1) then begin

IF A(I) MOD 2 = 1 THEN

x:=x+a[i];

X = X + A(I)

y:=y+1;

Y = Y + 1

end;

ENDIF

s:=x/y;

NEXT I

writeln(s);

S = X / Y
PRINT S

x=0;
y=0;
for (i=0; i<N; i++)
if (a[i]%2==1)
{ x=x+a[i];
y++;

X Y ,
. . , X
, Y
1. .

s=(float)x/y;

X
Y S.

printf("%f", s);

S.


C2-2009



30 ,
( , ).

122

15

C2-2010

30 .
0 100 .
20 .
, , . ,
.
, . , ,
.

const

N=30

N = 30;

DIM A(N) AS INTEGER

var

DIM I, J, MIN AS INTEGER

a: array [1..N] of integer;

FOR I = 1 TO N

i, j, min: integer;

INPUT A(I)

begin

NEXT I

for i := 1 to N do

...

readln(a[i]);

END

...
end.

123

#include <stdio.h>

A 30 .

#define N 30

I, J, MIN.

void main(void)
{int a[N];

1 30 A
1- 30-.

int i, j, min;

...

for (i = 0; i < N; i++)


scanf("% d", &a[i]);
...
}

( ), . (
, , Borland Pascal 7.0) -.
,
(, , ).
.

124

15


15.1
100 . 500
500. , , 7. , .
, . ,
, .

const

N=100

N=100;

DIM A(N) AS INTEGER

var

DIM I, X, M AS INTEGER

a: array [1..N] of integer;

DIM S AS SINGLE

i, x, m: integer;

FOR I = 1 TO N

s: real;

INPUT A(I)

begin

NEXT I

for i:=1 to N do readln(a[i]);

...

...
end.

END

125

15.2
100 . 0
500. , ,
.
.

15.3
30 .
150 200 . , 180 . , .
, .
.

126

15

15.4

30 , .
.

16


C3-2011

. , 3, 4 . . . , - , 4
- . , 25, .
, , , ? ? .

.
.
, . 16.1,
, .

.


C3-2008

. , 1, 2 . . . , 3 - ,
2 - . ,
17 .
, ,
, ? ? .

128

16

16.1

1-

2-

3-

4-

1-
( )

2-
(
)

1- (

,
)

2-
(
,

6, 4

3, 4

3, 8

7, 4

12, 8

16, 8
12, 12

16, 4

20, 4
16, 8

6, 12

10, 12
6, 16
12, 12

3, 16

7, 16
3, 20
6, 16

7, 12

11, 12
7, 16

15, 4

19, 4
15, 8

11, 8

15, 8
11, 12

12, 4

3, 12

11, 4

C3-2009

129

.
. .
(5, 2). ,
(x, y) :
(x + 3, y), (x, y + 3),
(x, y + 4). ,
(0, 0) 13 .
, ,
, ?

130

C3-2010

16

.
. (2, 1). . ,
(x, y) : (x + 3, y), (x, y + 4),
(x + 2, y + 2). ,
9. ,
. ,
, , ? ? .

131


16.1
: 7 . - . ,
. ? .
.

132

16

16.2
1 20 .
. , . , , , . ?
.
.

133

16.3
: 10 , 15. . , .
? .
.

134

16

16.4
"-" 3 3 . "" ""?
.

135

16.5
58 . .
1 4. , .
?
.

136

16

16.6
: . . , , (
) . , . . ,
. 33 35 . :
, ?
.

137

16.7
6 . .
. ?
.

138

16

16.8
. 500 . ,
(1, 2, 4, 8, ...). . ?
.

139

16.9
. 11 . . , . ?
.

140

16

16.10
25 . . , . ?
.

141

16.11
. .
. (3, 2).
, (x, y) :
(x + 5, y), (x, y + 4), (x + 3, y + 3). ,
(0, 0) 12 .
, , , ?
? .
.

17



C4-2011

,
( ,
, ).
, , ( , ,
Borland Pascal 7.0), ,
, . ,
, ( , ).
, 0, .
, "NO". , "YES", .
, . , :
Do not 911 to 09 do.

:
YES
91019

.
:
var a:array['0'..'9'] of integer;
c, c_odd: char;
i, k: integer;
f: boolean;
begin
for c:='0' to '9' do a[c]:=0;
read();
while c<>'.' do
begin
if c in ['0' .. '9'] then a[c] := a[c] + 1;
read(c);
end;

143

k := 0; { , }
for c := '0' to '9' do
if a[c] mod 2 = 1 then
begin
k := k + 1;
c_odd := c
end;
f := (a['0'] = 1);
for c := '1' to '9' do
if (a[c] > 1) or (a[c] = 1) and (a['0'] = 0) then f := true;
if (k > 1)or not f then writeln('NO') else
begin
writeln('YES');
for c := '9' downto '0' do
for i := 1 to a[c] div 2 do
write(c);
if k = 1 then
write(c_odd);
for c := '0' to '9' do
for i := 1 to a[c] div 2 do
write(c);
end
end.


C4-2009

, . N,
N :
<> <> < >

<> , 20 , <> , 4- (, , , ), <


> . <> <>,
<> < > .
:
.. 57

(
, , Borland
Pascal 7.0), ,
( ).
,
.
, N >= 1000.

144

17

C4-2010

()
92, 95 98.
.

( , , Borland Pascal 7.0), , .
. N :
<> <> <> <>

145

<> , 20 , <> , 20 ,
<> 92, 95 98, <> 1000 3000, . <> <>, <> <>, <> <> . :
95 2250

3 : , 92-, 95- 98- .


- , 0.
:
12 1 0

146

17


17.1
, ,
12 , ,
.
.
. ,
(, ).
.

147

17.2

, . , .
.
:
 :
10345859 1254386 132563
2377739 4237859

 :
103 -859
423 -859

18


. ,

A1

A2

Unicode .
:
1) 1 ; 2) 46 ; 3) 96 ; 4) 48 .
32 . " " 3 . :
1) 8; 2) 4; 3) 28; 4) 32.

A3

25 ,
12 . (
) .
:
1) 300 ; 2) 75 ; 3) 100 ; 4) 25 .

A4


. 120?
1) 5; 2) 4; 3) 3; 4) 2.

A5

A6

F16 148 :
1) 321; 2) 33; 3) 123; 4) 1101.

(. 18.1) :
3) A = 0; C = 0;
1) = 1; C = -1;
2) A = 1; C = 0;
4) A = 0; C = -1.

149
A := 3
C := 5

A := A + 1
C := C + 1

A>0

C := C + 1

C>0

. 18.1

A7

DO WHILE n <> 0

while n <> 0 do

PRINT (2 * (n MOD 10));

begin

n = n \ 10
LOOP

write (2 * (n mod 10))


n := n div 10;
end;

(\ Mod ,


)

{div mod ,


}


n <> 0
(2 * mod (n, 10));
n := div (n, 10);

| div mod ,

104128. n
:
1) 821401; 2) 12234; 3) 4132; 4) 4625.

150

A8

18

:
k 1 3
(x[2*k 1] > x[2*k])
S := x[2*k 1]; x[2*k 1] := x[2*k]; x[2*k] := S;

:
1) (74, 17, 12, 5, 15, 3);
3) (12, 15, 17, 3, 5, 74);
2) (5, 15, 3, 12, 17, 74);
4) (5, 3, 15, 12, 17, 74).

A9

A10

:
(sin() > 1) (y = x mod 5) (x div y < 3)
:
1) x = 3; y = 1;
3) x = 5; y = 3;
2) x = 8; y = 3;
4) x = 1; y = 2.


( ( ) )
:
1) ;
2) ;

A11

3) ;
4) .

:
X

F?
1) X Y Z X Y Z X Y Z;
2) X Y Z X Y Z X Y Z;
3) X Y Z X Y Z X Y Z;
4) X Y Z X Y Z X Y Z.

151

A12

, , :
1) 567; 2) 546; 3) 556; 4) 576.

A13

"X", "Y", "Z", "W" -


( 0 11 ).
WYXZ , :
1) 148; 2) E8; 3) 310; 4) 3A.

A14

, (), , , 1 = 3, 2 = 5, 3 = 7.
D = p1 p2 p3 = 105 ( 0 104). . , = 19 3, 5, 7 : () = (1, 4, 5). ,
3, :
1) (3, 0, 0); 2) (0, 3, 3); 3) (0, 2, 4); 4) (3, 3, 3).

A15

:
) z1.pas;
) z21.pas;
) z4.p;
) z33.p;
) zad.pas;
) zom.pp.
z*.p?? :
1) , , , ; 2) , , ; 3) , , , ; 4) , .
" ":

A16

N_

32

21

25

25

31

10

32

41

28

10

41

10

152

18

N_ > 2 > '8a' :


1) 1, 2, 3, 5, 7;
3) 3;
2) 3, 4, 5, 6;
4) 1, 3, 4, 6, 7.

A17

256512 /. ,
44 , 6 . :
1) 96; 2) 3; 3) 24; 4) 6.

A18

, :
B

69

10

70

71

=(B69:C70)
=(B69:D70)

70 71 D71
:
1) 2,2; 2) 2,0; 3) 1,05; 4) 0,8.

A19

=A2+$A$1

=A3*B2

=C2+2*$B$1

=D2+A3*2

=E2+$B$1

A3:E3 A4:E6 (, . 18.2) B2:E6.


C2:C6 :
1) ; 2) B; 3) C; 4) D.

153

30
25
20
D
15
A
10

5
B
0
1

. 18.2

A20

"" , . ""
6 :

?An

?Bn

!A

!B

+BA

+AB

BA

AB

:
?4 ?6 + ! !
:
1) 6 4; 2) 4 2; 3) 6 4;

4) 4 6.

154

18

. ,
B1

, 2 13, 14,
15, ... , 22, 23 3.

B2

:
F = ((A B) C) (A C),
15, 51, 85.
.
F .

B3

. :
1. .
2. 1.
38 11222. .

B4

, :
1. 3, 1 4.
2. 4, 3 2.
3. , 2 3,
, 4.
4. 4, 1 3.
. ( , , , .)

B5

640 5 .
_______ /.

B6

() :
1. 0.
2. :
,
( 0 1 ).
, :

155

(0) 0
(1) 001
(2) 001001110
(3) 001001110001001110110110001
1 6?

B7

32- , , IP- ,
IP- .
, IP- ,
1; , IP- , 0. , :
11111111 11111111 11100000 00000000 (255.255.224.0)
, 19 IP- , 13 .
,
:
1

255.255.252.0

255.255.230.0

255.255.255.128

255.255.255.240

, , 134.

B8

. , .
, ,
. ,
, .
1

" "

" "

156

18

.
, , (' '), ,
.
. .

C1

var
s: string;
a: char;
i, k: integer;
begin
readln(s);

k := 0;

for i := 1 to length(s) do
begin
if (s[i]=' ') and (s[i+1]<>' ') then a: = s[i+1];
if (s[i]<>' ') and (s[i+1]=' ') then if s[i]=a then
k := k + 1;
if (s[i-1]=' ') and (s[i]<>' ') and (s[i+1]=' ') then
k := k + 1;
end;
if k = 0 then
write(' )
else
write('k =', k);
end.

INPUT st$
K = 0
FOR i = 1 to LEN (st$)
IF (MID$(st$,i,1)=" ") AND (MID$(st$,i,1) <> " ") THEN
a$ = MID#(st$,i,1)
IF MID$(st$,i,1)<>" ") AND (MID$(st$,i,1) = " ") THEN
IF MID$(st$,i,1) = a$ THEN k = k + 1
IF MID$(st$,i-1,1) = " " AND MID$(st$,i,1) <> " " AND
MID$(st$,i+1,1) = " " THEN k = k + 1
ENDIF
NEXT i
IF k = 0 THEN
PRINT " "
ELSE
PRINT k
ENDIF
END

157

3 .
1. , .
2. , .
3. , , .
( , .)

C2

.
, .

C3

.
(2, 2). , (x, y) : (x + 1, y + 2), (x, y + 3), (x + 2, y + 1). ,
(8, 8). (8, y)
(x, 8), , .
: , , , ?
? .

C4

,
. N, 100,
N :
<> <> <> <>

<> , 20 , < , 4- , <> , , <>


0 1 ( ). <> <>, <> <>, <> <> .
:
>

.. 45 57 38 0

15 . :
 , ,
30 ;

.
(
, , Borland
Pascal 7.0), :
1) " ";
2) " ";
3) " 15 ".

19


1 " ,
"









1-2008: 4.
1-2009: 2.
11-2010: 2.
12-2010: 3.
1-2009: 3.
1-2010: 64.
1.1: 4.
1.2: 1.









1.3: 2.
1.4: 3.
1.5: 2.
1.6: 2.
1.7: 4.
1.8: 2.
1.9: 1.

2 " "









2-2009: 3.
2-2010: 2.
7-2009: 40.
7-2010: 1296.
2.1: 1.
2.2: 4.
2.3: 2.
2.4: 3.










2.5: 3.
2.6: 3.
2.7: 4.
2.8: 30 000.
2.9: 512.
2.10: 4800.
2.11: 4 .
2.12: 2400.















3.9: 3.
3.10: 1.
3.11: 2.
3.12: 2.
3.13: 2.
3.14: 4.
3.15: 3.
3.16: 2.
3.17: 4000.
3.18: 7.
3.19: 624.
3.20: 7.
3.21: 9, 27.

3 " "














1-2010: 2.
3-2010: 1.
4-2010: 4.
11-2010: 2.
3-2010: 7.
3.1: 2.
3.2: 3.
3.3: 2.
3.4: 1.
3.5: 2.
3.6: 4.
3.7: 3.
3.8: 4.

159

4 " "











7-2010: 1.
8-2010: 2.
9-2010: 3.
4-2010: 30.
4.1: 3.
4.2: 4.
4.3: 2.
4.4: 2.
4.5: 4.
4.6: 4.












4.7: 2.
4.8: 1.
4.9: 4.
4.10: 3.
4.11: 3.
4.12: 4.
4.13: 4.
4.14: 4.
4.15: 4.
4.16: 1.

5 " "






16-2009: 4.
17-2009: 1.
16-2010: 3.
17-2010: 4.
5.1: 3.

 5.2: ) 3; ) 2; ) 3.
 5.3: 2.
 5.4: 1.
 5.5: 3.

6 ""
 12-2009: 1.
 6-2008: 4.
 8-2009: BAAGFED.

 8-2010: .
 6.1: 4.
 6.2: 136.

7 " "





10-2009: 4.
14-2009: 1.
10-2010: 2.
14-2010: 4.

 7.1: 2.
 7.2: 4.
 7.3: 3.

8 " "
 13-2009: 3.
 13-2010: 2.
 8.1: 2.

9 "RGB-"
 13-2010: 2.
 9.1: 4.

 8.2: 4.
 8.3: 3.

160

19

10 ""





5-2009: 22111.
18-2010: 1.
5-2010: 2.
10.1: 211122.






10.2: NO6.
10.3: 1-3-5-4-5-6-G7( 7)-8.
10.4: .
10.5: 11011001.

11 ""












6-2009: 3.
5-2010: 1.
6-2010: 4.
B2-2010: 255.
11.1: 3.
11.2: 4.
11.3: 4.
11.4: 2.
11.5: 4.
11.6: 1.
11.7: 2.












11.8: 3.
11.9: 2.
11.10: 1.
11.11: 1.
11.12: 2.
11.13: 2.
11.14: 3.
11.15: 19.
11.16: 22.
11.17: 3.

12 " "









6-2009: .
6-2010: .
12.1: .
12.2: 12345, 12345.
12.3: "".
12.4: .
12.5: .
12.6. , , , . 2
3 ( , , ) . , , .
13 ""






9-2009: .
9-2010: .
10-2009: 1234.
10-2010: 4321.

 13.1: 4132.
 13.2: 3412.
 13.3: 1432.

14 " "
 1-2009.

1) x <= /2.
x y , ,
, . , -

161

, : x = 2; y = 0,95. "", " ".


2) :

CLS
INPUT x, y
if y >= 1 AND x >= 0 AND y >= SIN(x) AND x <= 3.14/2 then
PRINT ""
ELSE
PRINT " "
END IF
END

var x, y: real;
begin
readln(x, y);
if (y<=1) and (x>=0) and (y>=sin(x)) and (x<=3.14/2) then
write('')
else
write(' ')
end.
C
void main(void)
{ float x, y;
scanf("%f%f", &x, &y);
if (y <= 1)
if (x >= 0)
if (y >= sin(x))
if (x <= 3.14/2)
printf("");
else
printf(" ");
}

 1-2010.

1) : x = 1, y = 3. ( (x, y), : x2 + y2 < 4 x < 2,


y < 0 y <= x.)
2) ():
if (x*x+y*y >= 4) and (x >= 2) and (y <= x) and (y >=0) then
write('')
else
write(' ')

162

19

 14.1.

1) : x = 1, y = 0 ( (x, y), : y < x y < 0.)


2) (, x = 0):
if (y<=2-x*x) and (y>=0) and (x>=0) or (x<=0) and (y>=x) and (y<=2-x*x) then
write('')
else
write(' ')

 14.2.

1) , r1 r2 , , ,
x = 3,5, y = 3,5 ( "").
, z (
, 0), ( ) ,
.
2) . , -, r1 r2. -,
AND.

const r1 = 2.5, r2 = 1.5;


var x, y, z: real;
begin
readln(x,y);
z := (x-3.5) * (x-3.5) + (y-3.5) * (y-3.5);
if (r2*r2 <= z) and (r1*r1 >= z) and (y >= x) then
write('')
else
write(' ')
end.

r1 = 2.5
r2 = 1.5
INPUT x, y
z = (x-3.5) * (x-3.5) + (y-3.5) * (y-3.5)
IF r2^2 <= z AND r1^2 >= z AND y >= x THEN
PRINT ""
ELSE
PRINT " "
ENDIF
END

163

15 " "
 2-2009.

.
, (30) . . . , , , .
,
.

' 30
DIM a(30), b(30)
'
CLS
'
RANDOMIZE TIMER
' -20 19
FOR i = 1 TO 30
a(i) = INT(RND(1) * 40)-20
'
PRINT a(i);
NEXT i
'
PRINT
' ,
FOR i = 1 TO 30
IF a(i) < 0 THEN
b(i) = -a(i)
ELSE
b(i) = a(i)
END IF
NEXT i
'
FOR I = 1 to 30
PRINT b(i);
NEXT i
END

program modul;
{ }
uses crt;
{ }
var
a: array [1..20 ] of integer;
b: array [1..20 ] of integer;
i: integer;

164

19

begin
{ }
clrscr;
{ }
randomize;
{ -20 19 }
for i := 1 TO 30 do
begin
a[i] := random(40) - 20;
{ }
write (a[i], ' ');
end;
{ }
writeln; writeln;
for i = 1 to 30 do
begin
if a[i] < 0 then
b[i] := -a[i]
else
b[i] := a[i];
write (b[i], ' ');
end;
end.

 2-2010.

min := 100;

MIN = 100

for i := 1 to N do

FOR I = 1 TO N

if (a[i] >= 20) and (a[i] < min) then


min := a[i];
writeln(min);

IF A(I) >= 20 AND A(I) < MIN THEN


MIN = A(I)
ENDIF
NEXT I
PRINT MIN

min = 100;
for (i = 0; i < N; i++)
if (a[i] >= 20 && a[i] < min)
min = a[i];
printf("% d", min);

MIN
, 100.

20.

20,

MIN.
MIN,
MIN
.
.

MIN.

165

 15.1.

x:=0;

X = 0

m:=0;

M = 0

for i:=1 to N do

FOR I = 1 TO N

if (a[i] mod 10=7) then begin

IF A(I) MOD 10 = 7 THEN

x:=x+a[i];

X = X + A(I)

m:=m+1;

M = M + 1

end;

ENDIF

s:=x/m;

NEXT I

writeln(s);

S = X / M
PRINT S

 15.2.

' 100
DIM a(100)
'
CLS
'
RANDOMIZE TIMER
0 500
'
S = 0
FOR i = 1 TO 100
a(i) = INT(RND(1) * 501)
'
PRINT a(i);
S = S + a(i)
NEXT i
'
PRINT
'
SA = S/100
N = 0
' - ,
FOR i = 1 TO 100
IF a(i) < SA THEN
N = N + 1
END IF
NEXT i
'
PRINT "- , ="; N
END

166

19

program modul;
{ }
uses crt;
{ }
var
a: array [1..100 ] of integer;
sa: real;
I, sum, n: integer;
begin
{ }
clrscr;
{ }
randomize;
{ 0 500 }
sum := 0;
for i := 1 TO 100 do
begin
a[i] := random(501);
{ }
{ }
sum := sum + 0;
write (a[i], ' ');
end;
{ }
writeln; writeln;
{ }
sa := sum/100;
{ - , }
n := 0;
for i = 1 to 100 do
if a[i] < sa then
n := n + 1;
{ }
writeln(' , =', n);
end.

 15.3.

.
, , , ,
180 . i. min .
j ( i n 1) min AND , 180 .
, 180 min,
min. min.

167

const
N = 30
var
A: array [1..N] of integer;
i, j, min: integer;
begin
for i := 1 to N do
readln(a[i]);
i := 1;
while a[i] < 180 do
i := i + 1;
min := a[i];
for j := i to N do
if (a[j] < min) and (a[j] >= 180) then min := a[j];
writeln (' =', min);
readln
end.

N = 30
DIM A(N) AS INTEGER
DIM I, J, MIN AS INTEGER
FOR I = 1 TO N
INPUT A(I)
NEXT I
I = 1
WHILE A(I) < 180
I = I + 1
WEND
MIN = A(I)
FOR J = I TO N
IF A(J) < MIN AND A(J) >= 180 THEN MIN = A(J)
NEXT k
PRINT " =";min
END

 15.4.

N = 30
DIM A(N), B(N) AS INTEGER
DIM I, J, R AS INTEGER
CLS

168

19

'
FOR I = 1 TO N
INPUT A(I)
PRINT A(I);
NEXT I
PRINT
PRINT
'
'
FOR I = 1 TO N - 1
IF A(I) MOD 2 <> 0 THEN
IF A(I + 1) MOD 2 = 0 THEN
B(I) = A(I + 1)
B(I + 1) = A(I)
I = I + 1
ELSE
B(I) = A(I)
END IF
ELSE
B(I) = A(I)
END IF
IF I = N - 1 THEN
B(N) = A(N)
END IF
NEXT I
'
FOR I = 1 TO N
PRINT B(I);
NEXT
END

. ,
.
16 " "
 3-2008.

.
, (. 19.1), , .
.
19.1 .
, ,
.

 3-2009.

. , ,
(. 19.2).

169

19.2 . ,
, .
19.1

1-

2-

3-

1-
( )

2-
( )

1-
(

3, 2

3, 4

1, 2

4-
2-

( )

9, 4

18, 4

5, 4

15, 4

3, 12

3, 36

3, 6

3, 18




, ,

1, 4

3, 4

1, 6

1, 18

19.2

1-

2-

3-

4-

1-
(
)

2-
(
)

1-
(
)

(
)

11, 6

14, 6

8, 9

11, 9

8, 10

11, 10

11, 5

14, 5

8, 8

11, 8

8, 9

11, 9

5, 6
5, 2

5, 5
8, 2

8, 6

8, 5
8, 5 8, 6


3- 4-

 3-2010.

, (1, 1). ,
, (. 19.3).
19.3 . ,
, .

 16.1.

. (. 19.4).
. 19.4 ,
.

 16.216.10 . .

170

19

19.3
1-
2-
3-
4-

2-
1-
2-
( ) ( ) ( )

1, 1

3, 1

5, 3

1, 3

4, 3

4, 1

4, 3

5-
1-
( )
8, 3
11, 3
5, 7
8, 7
7, 5
10, 5
7, 3
10, 3
4, 7
7, 7
6, 5
9, 5
3- 4-
19.4

1-
2-
3-
4-

1-
2-
1-
2-
( ) ( ) ( ) ( )
12, 6
7, 6
(x + 5, y)
(x + 5, y)
(
(
13,14)
9,21)
7, 10
2, 6
2, 10
(x + 5, y)
(x + 5, y)
(x, y + 4)
3, 6
(
(
(
(x, y + 4)
12,21)
6,32)
10,19)
8, 12
5, 9
(x + 3, y + 3)
(x + 3, y + 3)
(
(
14,42)
10,77)
15, 5
10, 5
(x + 5, y)
(x + 5, y)
(
(
15,81)
11,18)
12, 9
5, 5
5, 9
(x + 5, y)
(x + 3, y + 3)
(x, y + 4)
2, 2
3, 2
(
(
(
(x + 5, y)
15,00)
7,07)
10,29)
11, 11
8, 8
(x + 3, y + 3)
(x + 3, y + 3)
(
(
15,56)
11,31)
15, 5
10, 5
(x + 5, y)
(x + 5, y)
(
(
15,81)
11,18)
12, 9
5, 9
5, 5
(x + 5, y)
(x, y + 4)
0, 5
(x + 5, y)
(
(
(
(x + 3, y + 3)
15,00)
10,29)
6,32)
8, 8
11, 11
(x + 3, y + 3)
(x + 3, y + 3)
(
(
11,31)
15,56)

171

17 " "
 4-2009.

, , , 99 ,
. , . , .
.

'
DIM nc(99);
'
CLS
'
INPUT N
WHILE RIGHT$(d$, 1) <> "."
INPUT k$
d$ = d$ + k$
WEND
' ( 97 122),
' d$
n = LEN(d$): r = 0
DIM f(122, 26), bu$(26), num(26)
FOR k = 1 TO 26
FOR j = 97 TO 122
f(j, k) = 0
FOR i = 1 TO n
test$ = MID$(d$, i, 1)
IF test$ = CHR$(j) THEN f(j, k) = f(j, k) + 1
NEXT i
k = k + 1
NEXT j
NEXT k
' bu$
' num .
' ,
k = 1: r = 1
FOR j = 97 TO 122
IF f(j, k) <> 0 THEN PRINT CHR$(j), f(j, k): bu$(r) = CHR$(j): num(r) = f(j, k):
r = r + 1
k = k + 1
NEXT j
PRINT "r="; r
'
FOR i = 1 TO r - 1
FOR j = 1 TO r - 2

172

19

IF num(j) < num(j + 1) THEN SWAP num(j), num(j + 1): SWAP bu$(j), bu$(j + 1)
NEXT j
NEXT i
'
PRINT
exit$ = ""
FOR i = 1 TO r - 1
exit$ = exit$ + bu$(i)
'PRINT bu$(i), num(i)
NEXT i
PRINT exit$
END

program uchastnuki;
var
nc: array[1..99] of integer;
p: 1..99;
c: char;
i, k, N, min: integer;
begin
readln(N);
for i := 0 to 99 do nc[i] := 0;
for i := 1 to N do
begin
repeat
read(c)
until c = ' '; { }
repeat
read(c)
until c = ' '; { }
readln(p);
nc[p] := nc[p] + 1;
end;
min := N;
for i := 1 to 99 do
if nc[i] > 0 then
begin
if nc[i] < min then min := nc[i];
end;
for i := 1 to 99 do
if nc[i] = min then
writeln(i);
readln
end.

 4-2010.
var
min, ans: array[92..98] of integer;
c: char;
i, k, N, b: integer;
begin
for i := 92 to 98 do
begin
min[i] := 3001;{ , >3000}
ans[i] := 0;
end;
readln(N);
for i := 1 to N do
begin
repeat
read(c);
until c = ' '; { }
repeat
read(c);
until c = ' '; { }
readln(k, b);
if min[k] > b then
begin
min[k] := b;
ans[k] := 1
end else
if min[k] = b then ans[k] := ans[k] + 1;
end;
{ - , ans[i] 0}
writeln(ans[92], ' ', ans[95], ' ', ans[98])
end.

 17.1.

.
:
Const d: array[1..12] of integer = (31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31);
var tm: array[1..12] of real;
m: array[1..365] of 1..12;
data: string[5];
max, ty, t: real;
i: integer;
begin
assign(input, 'meteo.dat');
reset(input);
for i := 1 to 12 do
tm[i] := 0;
ty := 0;

173

174

19
for i := 1 to 365 do
begin
readln(data, t);
m[i] := (ord(data[4]) - ord('0')) * 10
+ord(data[5]) - ord('0');
tm[m[i]] := tm[m[i]] + t;
ty := ty + t;
end;
for i := 1 to 12 do
tm[i] := tm[i]/d[i];
ty := ty/365;
max := 0;
for i := 1 to 12 do
if abs(tm[i] - ty) > max then
max := abs(tm[i] - ty);
writeln(ty:0:2);
for i := 1 to 12 do
if abs(tm[i] - ty) = max then
writeln(m[i], ' ', tm[m[i]]:0:2, ' ', tm[m[i]] - ty:0:2)

end.

 17.2.

4 , .
18 " "

 1: 3.
 2: 3.
 3: 3.


















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











175

1: 13.
2: 250.
3: 12.
4: 13.
5: 1024 /.
6: 364.
7: 2.
8: 3241.
1.
,
( ). -. , .
: ,
, :
KAK TAK
, , , . 2:

1) :
if (s[i-1]=' ') and (s[i]<>' ') and (s[i+1]=' ') then
k := k+1;

2) .
: .

var
s: string;
a: char;
i, k: integer;
begin
readln(s);

k := 0;

s := ' ' + s + ' '


for i:=1 to length(s) do
begin
if (s[i]=' ') and (s[i+1]<> ' ') then a:= s[i+1];
if (s[i]<>' ') and (s[i+1]= ' ') then if s[i]=a then
k := k + 1;
end;
if k = 0 then
write(' ')
else
write('k =', k);
end.

176

19


CLS
DIM st, a, b AS STRING
DIM k, i AS INTEGER
INPUT st$
k = 0
a$ = MID$(st$, 1, 1)
FOR i = 1 TO LEN(st$)
IF (MID$(st$, i, 1) <> " " AND MID$(st$, i + 1, 1) = " ") OR (MID$(st$, i, 1) <> " " AND
i = LEN(st$)) THEN b$ = MID$(st$, i, 1): IF a$ = b$ THEN k = k + 1
IF MID$(st$, i, 1) = " " AND MID$(st$, i + 1, 1) <> " " THEN a$ = MID$(st$, i + 1, 1)
NEXT i
IF k = 0 THEN
PRINT " "
ELSE
PRINT k
END IF
END

 2.

, , . , , .
: ,
,
.

const n = 30;
var a: array [1..n+1] of integer;
s, i, j: integer;
begin
readln (s);
i := 1;
while (s > a[i]) and (i <= n) do
i := i + 1;
for j := n downto i do a[j + 1] := a[j];
a[i] := s;
end.

N = 30
DIM s, i, j, a(N+1) AS INTEGER
INPUT s
i = 1
WHILE (s > a(i)) and (i <= N)
i = i + 1
WEND

177

FOR j = n TO j STEP -1
a(j+1) = a(j)
NEXT j
a(j) = s
END

 3.

, , ,
. "-" , . .
, (. 19.5),
, . .
19.5

1-

2-

3-

4-

1-
(1-
)

2-
(
)

1-
( )

2-
(
)

5, 8

4, 9

4, 6
(x + 1, y + 2)

2, 2

3, 4
(x + 1, y + 2)

3, 7
(x, y + 3)

5, 5
(x + 2, y + 1)

6, 7


4, 9

3, 10

5, 8

6, 7


5, 8

7, 6

. 19.6.
. 19.7.
19.7 . , , , " ".

178

19

19.6

2, 2

1-

2-

3-

4-

1-
(2-
)

2-
(
)

1-
(
)

2-
( )

3, 7
(x + 1, y + 2)

4, 9

3, 10

5, 8

2, 8
(x, y + 3)

2, 5
(x, y + 3)

4, 6
(x + 2, y + 1)

5, 8

4, 9

6,7

19.7

1-

2-

3-

4-

1-
(3-
)

2-
(
)

1-
(
)

2-
( )

5, 5
(x + 1, y + 2)

2, 2

4, 3
(x + 2, y + 1)

4, 6
(x, y + 3)

6, 4
(x + 2, y + 1)

6, 7


5,8

7, 6


6, 7


4,9

5,8

7, 6


6, 7


8,7

179

 4.

:

program C4;
Var
a:array [1..100] of

Integer;

s1: String;
s2: string[2];
sum, n, i, j, lg ,nelg, l, r, bl, p, rr, max: integer;
ch: char;
begin
readln(N);
lg := 0;

nelg := 0;

for i := 1 to n do
begin
readln(s1);
p := pos(' ', s1);
s1 := copy(s1, p+1, length(s1)-p);
p := pos(' ', s1);
s1 := copy(s1, p+1, length(s1)-p);
ch := s1[10];
l := 0;

sum := 0;

for j := 1 to 3 do
begin
s2 := copy(s1, 1, 2);
s1 := copy(s1, 4, length(s1) - 3);
val(s2, bl, r);
sum := sum + bl;
if bl > 30 then l := l + 1;
end;
if l = 3 then
begin
if ch = '0' then
begin
nelg := nelg + 1;
a[nelg] := sum;
end
else
lg := lg + 1;
end;
end;
if lg > 15 then
writeln(' >15')
else
if lg + nelg < 15 then
writeln(' ')

180

19
else
begin
if (lg = 15) or (lg + nelg = 15) then
writeln(' ')
else
begin
sum := 15 - lg;
for i := 1 to sum+1 do
begin
max := i;
for j := 2 to nelg do if a[j] > a[max] then max := j;
rr := a[i];

a[i] := a[max];

a[max] := rr;

end;
if a[Sum] = a[sum + 1] then writeln(' >15')
else writeln(' ')
end;
end;
end.

-




















http://www.mon.gov.ru/
http://2379763.495.su/

http://www.fipi.ru/

http://www.ege.ru/

http://www.school.edu.ru/

http://www.mosedu.ru/
Online-
http://www.klyaksa.net/test_online/

http://www.c-mentor.ru/download/ege_inform.shtml

http://schools.keldysh.ru/faculty-it/ege/ege.htm

http://www.aktanish.ru/edu/school/aktsh3/info/ege.htm

http://forum.allsoch.ru/
Online- "". !
http://www.ht.ru/on-line/tests/egeism.php

http://www.eltarea.ru/rb-topic_t_194.htm
-
http://www.abiturcenter.ru/
" "
http://www.edu.ru/

http://www.rusedu.info/Article92.html
-
http://www.ito.su/2004/html/4614.html
XII - "
" ("-2002")
http://ito.edu.ru , http://ito.bitpro.ru

182





















http://2003.pedsovet.alledu.ru/forum/636/416/5320/1

http://www.ed.gov.ru/

http://www.lbz.ru/index.php?div=downloads
. . :
http://onmcso.narod.ru/metod.htm

http://www.bolgar.info/index.php?module=News&catid=
&topic=5&allstories=1&MDPROSID=af199c1c98530e4d7c94a6767c0cf68e

http://sputnik.mto.ru/Docs_26/Ped.jurnal/Vio/Vio_15/cd_site/Articles/art_1_17.htm
:
http://catalog.alledu.ru/
:
http://www.catalog.alledu.ru/predmet/info/
" - " ( 1999 . "")
http://www.informika.ru/
" "
http://www.ug.ru
" "
http://www.1september.ru/ru/first.htm
" "
http://www.courier.com.ru/

http://www.eduland.ru

http://edu.rin.ru/index.html

http://www.156.ru/teachers-room/information/exam/exam.htm

http://som.fio.ru/item.asp?id=10009004

http://kpolyakov.narod.ru/school/ege.htm


1. . ., . ., . . .
.: , 2005.
2. . . . . . .:
, 2009.
3. ., ., . . .: , 1998.
4. - / . . . , . . . .:
, 2008.
5. . . . .: -,
2008.
6. . ., . . : , , . -: , 2008.
7. . . - . .: -, 2002.
8. . . . .: , 2006.
9. . ., . ., . . . .: , 2008.
10. . ., . ., . . . --: , 2005.
11. . ., . . 2010. . . .: , 2010.
12. . ., . . . -2009. . .: ,
2009.


............................................................................................................... 3
1. ,
..................................................................................................................... 5
2. .................................................. 13
3. .................................................................................. 21
4. .......................................................................................... 34
5. ....................................................... 48
6. ........................................................................................ 57
7. .............................................................................................. 62
8. ........... 69
9. RGB- ..................................................................................... 73
10. ........................................................................................... 75
11. ...................................................................................... 82
12. ................................................................................ 100
13. ................................................................................................ 107
14. ............. 112
15. ............................................................. 120
16. .................................................. 127
17. ............................................................. 142
18. ................................................. 148
19. ...................................................................... 158
- ........................................................... 181
............................................................................................................... 183

Оценить