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

2010 .

1.
1.1. ,
8 ,
:

1
1.1
1.1.1

1.1.2
1.1.3
1.1.4

1.1.5

,


"".
.
;
,

:

.
:
, ,

.
. ,
,



1.1.7
.

1.1.8
.
ASCII.
1 2004 2009
. 2009 ,
, ,
, 2009 .
,
2009 , .
:
, .
1.1.6

1.2. ,

.
2009
2 1.

11

19

21

25

1

. ASCII.





2




. ,

- .

- - (.4

(.)
)

1.1.8.

1.1.4.

1.1.7.

1.1.7.

1.1.5.

1.1.3.

1.1.7.

1.1.6.

1.3. .
.
1.3.1. . ASCII.
. 1
:
1) ,
, : 2-2004 (
3

), 1-2005, 1-2006, 1-2007, 1-2008.


;
2) , , 16 -
8 . ,
, : 1-2009 (
), 3-2010( );
:
.
1-
1 .
, ,
:
, ,
.

A2
2004

1) 108

2) 864

3) 108

4)

864

.
, .
, , ,
10-30 , ,
, ,
.
1234*56789*10
12345*678910
123*45678910
,1*2 32
****,*
26
****
25
****.
25
: 108
108 ( ) 864 , 2.

.
2
A1
2009


, 16-
Unicode, 8- -8.
480 . ?

1) 30

2) 60

3) 120

4) 480

.
480 , 480:8=60 . 16-
Unicode, 8- -8 ,
.. .
60 , , 60 , -8
1 . : 60 ,
2.
2.
4

1.3.2. .
2
, ..
2009 .
, 2009
:
1) .
: 4-2004 ( ), 3-2006
;
.
1-
1 .
2) ,
.
, : 2-2009(
), 3-2008, 3-2007, 3-2005(
3)
( ).

.
.
,
: 3-2010 ( )[9]

3-
3 .
A4
2004

, 32 .
?

1) 5

2) 2

3)

4)

:
8 , 32 8, 4 ,
4.
119 .
,
,
. ,
, 70 ?
A2
2009

1) 70

2) 70

3)

490

4)

119

:
:
1) k,
;
2) 70 .
, , 119.
N=2k k = [log2 N]+1, [log2 N] N
2. ,
, , .
5

N=119, k=7.
, 2 k < N k. ,
7 .
70 7*70=490 ,
3.
6
( 33 )
.

(

).
, 125 .
1) 375
2) 750
3) 500
4) 625
:
33 6 ,
4 .
, ,
6 , .. 4 .
6 , 36 ,
5 , .
125 625 .
: 4
A2
2010

1.3.3.
. 3
,
:
1) :
5-2004 ( ), 4-2005;
2) ,
: 4-2006 ( ), 4-2007;
3) ,
: 4-2008 ( );
4) - , 2
. ,
, : 3-2009 ( )
5) ASCII.
: 3-2010 [9], .
.
1- .
1 .
A5
2004
1) 10012

2510 ?
2) 110012

3)

100112

4)

110102

:
,
. , ,
11001.
6

25
1

2
12
0

2
6
0

2
3
1

2
1
1

2
0

. , 2532, 32=25, , 25
5 , 43210 . 25 2.
25=16+8+1=1*24+1*23+0*22+0*21+1*20.
: 11001.
2.
A4
2006

126

1) 1

2) 2

3) 3

4) 0

:
, ,
. ,
.
126= 64+32+16+8+4+2= 1*26+1*25+1*24+1*23+1*22+1*21, 1111110.
1
A4
2008

194,5?

1) 5

2) 6

3) 3

4) 4

:
,
.
5-2004.
194=128+64+4= 1*28+1*26+1*22, 101000100. ,
: ,
, .
.
0.5*2=1.0
0. 5
1 0
: 101000100.1,
4.
A3
2009

: =D716, b=3318. c, ,
a<c<b?

1) 11011001

2) 11011100

3) 11010111

4) 11011000

2 -
:

. .
. 4,
16- 4 .
. a ,
7

.
. 3, 8-
3 ,
.
D=13=8+4+1
=D716
7
b=3318
3
3
1
1 1 0 1 0 1 1 1 2
b2
0 1 1 0 1 1 0 0 1
1 1 0 1 1 0 0 1 a<1
b
1 1 0 1 1 0 0 1
2=1
1 1 0 1 1 1 0 0 a<2
1 1 0 1 1 1 0 0 b2<2
1 1 0 1 0 1 1 1 a=3
b2>c4
1 1 0 1 1 0 0 0
1 1 0 1 1 0 0 0 a<4
, .
4.
ASCII/

1
3
A
Y
Z

49
51
65
89
90
61
63
101
131
132
9?
A3
2010

1) 100

2) 11

3) 71

a
97
141

z
122
172

4) 57

:
: 9,
.
, 1 . .

3
4
5
6
7
8
9

51
52
53
54
55
56
57
63
64
65
66
67
70
71
57 , 71.
: 3

1.3.4. ,
. 4
:
1) - .
: 5-2005
( ).
.
2) 10
.
: 6-2004 ( ) 5-2007.
( );
3) 8- 16- .
: 52006 ( ), 5-2008;
4) - 8- 16- .
, , , 8, 16- : 4-2009 (
), 4-2010, [9].
:
.
2 -
2 .
8

A5
2005

x y,
x=10101012
y=10100112

1) 101000102

2) 101010002

3) 101001002

4) 101110002

:
. :
0;
;
1+0+0=1, 0;
1+1+0= 0, 1;
1+1+1=1, 1;
:
1
0 1 0 1 1 1 0
0 1 0 1 0 1 0 1
0 1 0 1 0 0 1 1
1 0 1 0 1 0 0 0 +
2.
A6
2004

102 + 108 +1016 .


:

1) 10100010

2) 11110

3)

11010

4)

10100

:
.
. ,
. ,
3, .. 8=23,
3 , : 001000,
. 16- ,
4, 4
, : 00010000, .
.
1

0
1

0
0

0
0
1
0 1

0
0
0
0

1016
108
102
102 + 108 +1016

3
.
1) ,
, :
108=

1
0
, .
0
0
1
0
0
0 =10002
2)
, .
. 10- ,
2+8+16=26. ,
. , 5 ,
1 1 3 4 , 0.
9

4 3 2 1 0
1 1 0 1 0
, .
A5
2007

1016 + 108 102

1) 1010

2) 11010

3) 100000

4) 110000

:
,
. 16+832. ,
25=100000.
3
A5
2008
1)

x y, x = A616, y = 758.
.

110110112

2)

111100012

3)

111000112

4)

100100112

:

, 6-2004, , 52005. :
0 1 1 1 1 0 0 0
1 0 1 0 0 1 1 0
0 0 1 1 1 1 0 1
1 1 1 0 0 0 1 1 +
3
A4
2009
1)

x y, x = 438 , y = 5616,.
.

1218

2)

1718

3)

6916

4)

10000012

:
. ,
10- . x = 48+3=35, y = 516+6=86,
121. 4, .. 10-
65. 8- , 1718.
. ,
8- 10-. y
= 516+6=8610=1268. 8- :
0 1 0

6+3=9, 9-8=1, 1;
1 2 6
1+2+4=7, 0;
0 4 3
0+1+0=1, 0.
1 7 1
2

1.3.5. . 11
,
.

10

1) 5
. , : 162004, 13-2005( );
2) - 5 4
. , : 12-2006
( );
3) - 4 ( 5
, 11-2010),
, , 16- .
, 16-
: 13-2007 ( ), 13-2008, 11-2009, 11-2010
[9].
:
.
2 - .
1 .
A13
2005

5 ( , - ). :
A
000

B
01

C
100

D
10

E
011

, 0110100011000
1) EBCEA
2) BDDEA
:

3)

BDCEA

4)

EBAEA

, ..
, D C.
, .
. .
3 .


EBCEA
BDDEA
BDCEA
EBAEA
3
A13
2006

000

0110100011000
01101100 ,
011010 ,
0110100011000
01101000011 ,

5 ( -
, ). :

11

01

001

10

,
. :
1) 110100000100110011
2) 111010000010010011
3) 110100001001100111
4) 110110000100110010
:
, .
,

11

.
.

11-01-000-001-001-10-011= ,
11-10-10-000-01-001-001-1=
11-01-000-01-001-10-01-11=
11-01-10-000-10-01-10-01-0= -

1)
2)
3)
4)

, , ,
( 00 11 ).

, :
A13
2007

1) 138

2) DBCA

3) D8

4) 3120

:
: =00, =01,
=10, =11. : =11011000.
, 16 .
4, 4 ,
1101-1000, 16- .
1101=8+4+1=13=D, 1000=8.
3

1.4. . .
.
1.4.1. . 1
2009 ,
, .
:
1) ,
, ,
: 3-2004 ( ), 2-2007, 2-2008
( ), 1-2009( 2-2008);
2)
, , : 22005, 2-2006( ).
3) , 1-2010, [9], .
:
.
1-
1 .
A3
2004
1) 4

64 : 8 8 .

?
2) 5

3)

4)

.

. 1 8, 8.
1 8, 8.
12

N=2k, N , k ,
. 8 3 , .. 8=2 3.
8,
, 6 .
3
.
A2
(, ).
2008 ,
18 ?
1) 6
2) 5
3) 3
4) 4
.
3, b=3.
18.
18=3k, , 2<k<3. ,
, k=3.
3
,
A2
. (, ,
2006 ..) ,
( )?
1) 80
2) 120
3) 112
4) 96
.
.
, 5, N1=25=32.
, 6. N2=26=64.
N= N1+ N2 =32+64=96.
4.
, ,

, .
:
, , .
?
.
,
3 5 = 243.
: 243
1
2010

1.4.2. .
, .
3
:
1)
. : 1-2004 (
), 1-2006, 3-2010[9]( );
2) - ,
: 1-2005, 1-2007, 1-2008
( );
13

3) - b
xb ,
, : 32009 ( ).
4) , ,
.
. 3-2010[9] ( )
:
.
1- .
, 2009
:
.
- 2 - .
1
2004

12 110.

.
: 110b=12,
.
1. : 1
, .
b=2 N=12=1*22+1*21+0*20=4+2+0=6, 12
b=3 N=12=1*32+1*31+0*30=9+3+0=12. : b=3
2: . : b2+b=12
b2+b-12=0, .
: b=3
1
2008

,
23 2

.
: N=23=21+2. , 2-
, 3
. 21 b
b, .
23=1*b+2
23=2*b2+1*b+2= (2*b+1)* b+2.
21, 3, 7, 21.
, 23 3, 7, 21
b=3, 23=2*9+1*3+2
b=7, 23=3*7+2
b=21, 23=1*21+2.
: 3, 7, 21

3
2009

,
25, 11.

.
, 11.
, 0, 1, 2, 3:
1) 011
2) 111
14

3) 211
4) 311.
5. ,
16+5=21. 2114=2*16+5=37 25.
.
: 5, 21
3
2010

16.

.
, 16 n16, n=1,2,, .
16, 16=24.
, 16, 4

1.4.3.
. 7
:
1) ADSL-
. : 7-2009 (
);
2) -
. : 5-2006 ( );
5-2007( );
3) .
. ,
: 5-2005 (
).
4)

. : 72010[10]
:
.
- 3 -
: 3 .
7
2009

ADSL- 128000 /c.


625 .

.
. 625 =625*8*1024 =5000*210
= (5000*210)/(27*1000)=5*23=40 .
,
10 .
: 40
B5
2006

15

,
10 .
( ),

, 32
/? ( )
.
/. , 8,
4 . ,
10*60=600 . : 4*600=2400 .
: 2400
B5
2005

,
28800 /, 640480
, , ?

.
:
1) .
. 28800 / 8 = 3600 /.
2) : 640*480*3 . ,
.. , .
3) 640*480*3/3600=64*48/12=64*4=256
: 256

, 2 17 .
,

215 . ,
4
.
, 512 .
( )
?
, .
7
2010

.
.
4 = 2223220 = 225
512 = 2923210 = 221
512 t1=221/217 = 16 .
4 t2 = 225/215 = 1024 .
1040 .
: 1040

16

2.

2.1. ,
5 ,
:


1.2.1
, , .

1.2.2
:
, ,
1.2.3
. (, ,
).
1.2.4
(, , , ,
.)
1.2.5

. :

, . 1.2.5.
2004-2009 .
1.2

2.2. ,

:

17

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

1.2.3

1.2.4.

- .

- - (.4

(.)
)

.)
12
12
1.2.1.
2

1
2
,

18
18 1.2.1.,
2

1
5

1.2.2.

.
2
20
2

1.2.2.
2

1
1

: ,
,
23
5

1.2.2.
2

1
6

26
8
,
1.2.1.
2

1
10

2009 6, 18, 8.

2.3. 1(). .

2.3.1. . (, ,
) . 5
:
1) - ,
: 8-2004, 6-2005, ;
2)
, : 52009: , 9-2004: , 7-2005, 7-2006:
, 7-2007, 7-2008, 5-2009, 5-2010: .
.
:
.
2 - .
2 .
1)
2) A8


3)2004

-?
4)

.
: 3-. -
.
18

.
.
:3
A6
2005

-:
, , -

1)
,

2) ,

3)
,

4) ,

.
,
: 2 - ,
.
.
2
A5
2009

c
.

a=5
a=a+6
b=a
c=a2*b
1) c = 11

a:=5;
a:=a+6;
b:= a;
c:=a2*b;
2) c = 15

a:=5
a:=a+6
b:= a
c:=a2*b
3) c= 274

4) c = 33

.
.
:

a
b

a:=5;
5


a:=a+6;;
11


b:= a;
11
-11

c:=a2*b
11
-11
33
: 4
A9
2004
19

x, y t
:


x=5
y=7
t=x
' MOD -
,


`
x= y MOD x
y=t
1) x=2, y=5, t=5

x:=5;
y:=7;
t:=x;
x:= y mod x; {mod ,



}
y:=t;

2) x=7, y=5, t=5

3)

x:=5;
y:=7;
t:=x;
x:=mod (y,x); | mod ,



|
y:=t;

x=2, y=2, t=2

4)

x=5, y=5, t=5

.

. .

x
y
t
x:=5;
5


y:=7;;
5
7

t:= x;
5
7
5
x=y mod x;
2
7
5
y:=t
2
5
5
1
A7
2006

a b
:

a=2468
b=(a MOD 1000)*10
a=a\1000+b'

1) a = 22, b = 20

a:=2468;
b:=(a mod 1000)*10;
a:=a div 1000+b;

2) a = 4682, b = 4680

a:=2468
b:=mod(a, 1000)*10
a:=div(a, 1000)+b

3) a = 8246, b = 246

4) a = 470, b = 468

.
,
.
. .
,
.

a:=2468;
b:=(a mod 1000)*10;
a:=a div 1000+b;

a
2468
2468
4682

b

4680
4680

2
A5
2010

20

a = 20
a:=20;
a:=20
b=7
b:=7;
b:=7
a = a b*2
a:= a b * 2;
a:= ab*2
IF a>b THEN c = a + b
if a>b then c:=a +b
a>b a:=a + b
ELSE c = b -a
else c := a - b;
c = b -a
ENDIF
c .

1) c = 1

2) c =23

3) c= -1

4) c = 13

.

.
:

a
b

a:=20;
20


b:=7;
20
7

a:= a b * 2;
6
7

a>b
6>7
1
1

2.3.2. (, ,
, .). 6

.
:
1) - :8-2007,
, 8-2008, . :
.

.
.
.
2) : 10-2004, 8-2006.
: ,
.
:
, .
.
3) : 8-2005, 6-2009.
8-2005 .
.
4) : 19-2005, 252004.
5) . 6-2010,
.
:
.
3 - .
5

21

A8
2007

A[1..100] B[1..100]
:
B ?

FOR n=1 TO 100


A(n)=n-10
NEXT n
FOR n=1 TO 100
B(n)=A(n)*n
NEXT n
1) 10

for n:=1 to 100 do


A[n]:=n-10;
for n:=1 to 100 do
B[n]:=A[n]*n

2) 50

n 1 100
A[n]=n-10

n 1 100
B[n]=A[n]*n

3) 90

4) 100

.
100 .
, , . B
, ..
n,
. .
1 9 -9 1, 10 . 10
. ,
( 0) 90.
: 3
A[1..100] B[1..100]
:

FOR n=1 TO 100


for n:=1 to 100 do
n 1 100
A(n)=(n-80)*(n-80)
A[n]:= (n-80)*(n-80);
A[n]=(n-80)*(n-80)
NEXT n
for n:=1 to 100 do

FOR n=1 TO 100


B[101-n]:=A[n];
n 1 100
B(101-n)=A(n)
B[101-n]=A[n]
NEXT n

B ?
A8
2008

1) B[1]

2) B[21]

3) B[80]

4) B[100]

.
.
n=1, 80, 100. :
[1]=792, A[80]=0,
A[100]=202. ,
.
. ! n=1
B[100]=A[1], n=100 B[1]=A[100], n=80 B[21]=A[80].
, ,
.
4
22

A10
2004

FOR n=1 TO 5
for n:=1 to 5 do
FOR k=1 TO 5
for k:=1 to 5 do
B(n, k)=n+k
B[n,k]:=n+k;
NEXT k
NEXT n
B(2,4)?
1) 9

2) 8

n 1 5
k 1 5
B[n, k]=n+k

3)

4)

.
n, .
k, .
n=2, k=4 B[n,k] =n+k=4+2=6; .
4
77

?
1) 49
2) 28
3) 21
4) 7

FOR n=1 TO 7
for n:=1 to 7 do
n 1 7
FOR k=1 TO 7
for k:=1 to 7 do
k 1 7
B(n, k)=kn
B[n, k]:=kn;
B[n, k]=kn
NEXT k

NEXT n

A8
2006

.

k
1
2
3
4
5
6
7
, ,
n
.
1
0
1
2
3
4
5
6

2
-1 0
1
2
3
4
5
,
3
-2 -1 0
1
2
3
4

.
4
-3 -2 -1 0
1
2
3

5
-4 -3 -2 -1 0
1
2
. ,
6
-5 -4 -3 -2 -1 0
1
() k=n
7
-6 -5 -4 -3 -2 -1 0
, 7.
49 , 49-7=42 . k>n
, k<n
. , ..
21
: 3
A8
2005

23

A 1010
0.
(
, ).


FOR n=1 TO 4
FOR k=n TO 4
A(n,k)=A(n,k)+1
A(k,n)=A(k,n)+1
NEXT k
NEXT n

for n:=1 to 4 do
for k:=n to 4 do
begin
A[n, k]:=A[n, k]+1;
A[k, n]:=A[k, n]+1;
end

n 1 4
k n 4
A[n, k]:=A[n, k]+1
A[k, n]:=A[k, n]+1

1?
1) 0

2) 16

3) 12

4) 4

.
100 ,
.. .
:
1) n=1, k=1,2,3,4 1
1
1
: a11,a12,a13,a14, 1 2 1
0
0
: a11,a21,a31,a41 a11 1 0
0
0
. 1 0
0
0
0
1
.
2) n=2, k=2,3,4 1 1 1
1
1
: a22,a23,a24, 1 1 2
1
1
: a22,a32,a42 a22 1 1
0
0
. 1 1
0
0

1
1
3) n=3, k=3,4 1 1 1
1
1
: a33,a34, 1 1 1
2
1
: a33,a43 a33 . 1 1
1 1
0
1
.
4) n=4, k=4 1
: a44, 1
: a44 a44 .
.

1
1
1
1

1
1
1
1

1
1
1
1

1
1
1
2

, 12
, 1, 4 , , ,
2, .
: 3
A6
2009

, A
n*n.

k=1
FOR i = 1 TO n
c = A(i,i)
A(i,i) = A(k,i)
A(k,i) = c
24

k:=1;
for i:=1 to n do
begin
c:=A[i,i];
A[i,i]:=A[k,i];

k:=1
i 1 n
c:=A[i,i]
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-
.
:
A[i,i] , A[k,i] k- . :
k- .
: 3
A19
2005


0,5 .
, 3
.

1) 1 .

2) 1,5

3)

3 .

4)

4,5 .

.
, ,
, ,
. : 1000000 - 0.5 ,
3000000
1.5
2
Max
A25 Dist NxN,
2004 :
Max:=0;
for i:=1 to N do
for j:=1 to N do
if Dist [i,j]>Max then Max:=Dist [i,j];
N=1000 5 .
N=2000:
1) 10 .

2) 20 .

3)

30 .

4)

40 .

.
,
. NxN,
NxN. :
1000*1000 5
2000*2000 .
=(4000000*5)/1000000=20 .
2
25

0
10 k i.
, ,
, .
A6
2010

FOR i=0 TO 10
A(i)=i;
NEXT i
FOR i=0 TO 10
k=A(i)
A(i)=A(10-i)
A(10-i)=k
NEXT i

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


A[i]=i;
For (i=0; i<=4; i++)
{
k=A[i];
A[i]=A[10-i];
A[10-i]=k;
}
1)
2)
3)
4)

For i:=0 to 10 do
A[i]:=i;
For i:=0 to 4 do
begin
k:=A[i];
A[i]:=A[10-i];
A[10-i]:=k;
End;

i 0 10
A[i]:=i

i 0 4
k:=A[i];
A[i]:=A[10-i];
A[10-i]:=k;

10 9 8 7 6 5 4 3 2 1 0
0 1 2 3 4 5 6 7 8 9 10
0 1 2 3 4 5 4 3 2 1 0
10 9 8 7 6 5 6 7 8 9 10

.

. 11 ,
: 0 1 2 3 4 5 6 7 8 9 10.
5
. , :
0 10, 1 9, 2 8, 3 7, 4 6. C 6 .
: 1

2.3.3. ,
. 12

.
2 - .
2
:
1) -

. ,
. : 12-2009,
, 17-2004, 14-2005, 14-2006, 14-2007, 14-2008.
.
2) - .
26

. 20-2007,
3) - .
. 12-2010,
.[9]
, ,
. A, B, C.
B, D, C, .
, C, E, B, .
?
1)
2)
3) BCD
4) BCB
A12
2009

.
,
.

1
2
3
4

C
B
B
E
A
C
2)
B
C
D
1)
B
C
B
2)
2)
3) , C, E, B, 1)
B, D,C

, ,
2) B, D,C

3


1
,
A20 , a, b, c , i, k .
2007 :
(a) a. ( )
(a, i) i- () a. ( )
(a, b) , a,
b. ( )

(, a := ).
:
i := (a)
k := 2
b :=
i > 0

c := (a, i)
b := (b, c)
i := i k

b := (b, )
b
, a ?
1)
27

2)

3)

4)

.
,
.
i := ( )
k := 2
b :=
i > 0

c := (a, i)
b := (b, c)
i := i k

b := (b, )

i=5
k=2
b=A
1)5>0

2)3>0

3)1>0

=
b=
i=3

=
b=
i=1

4)-1>0

=
b=
i= -1

b=

1
,
BR69KBK .
R6 FL, - 12,
,
:
A12
2010
.2

1) 12BFL91

2) 12BFL9

3) KBFL912BK

4) 12BFL1

.
,
:
1) R6 FL, BFL9KBK;
2) 12, 12FL912 K;
3) , 12FL91.
: 1
,
A12
, :
2010
.3 : 8, 1, 6, 2, 4. 5 1.
5 2.
, ,
:
1) 8, 2, 6, 4

2) 4, 2

3) 4, 1, 2, 3, 5

4) 4, 2, 4

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

2.3.4.
. 18
:
28

.
2 - .
5
, :
1) - . 18-2009 ( ), 20-2008 . 2010
[7,9].
2) - :232005 ( ), 20-2006 ( ).
A18
2009

,
: , , , .
:


: , , , .

, :



< > , ,
.
, , ,
1
2 6

, ?
3 4 5

5 4
< >
6 3
< >
9
7 2
< >
10
8 1
< >
A B C D E F
1) 1

2) 2

3) 3

4) 0

.

, . .
, , ,
, .
, . 8
, .. F4. 2, 4, 6, 7
F8, F4,
. 1, 6-4-4-5-5:
1 . 3,
F5-F1-B1-B4-F4. 9 B2-B1 - 1-4- F4.
10 : 1-5-3.
5.
: 1
:
: , ,

29

A18
2010

,
.

.6
[7]


: , , , .

, :



< >
, , .
,
.
, ,
,
, ?
6
1
6

7
2
5
< >
8 3
4 4
< >
9
5
3
< >
10
2
< >
11
1

A B C D E F
1) 1

2) 2

3) 3

4) 0

.

, . .
, , ,
, , .
, .
1: , 6-4- , 4-6,
.
2: 5-F5, , , F5-5, , ,
.
3: 4-4, 4-3, 3-3, 3-4, .
4: .
5: D3-3, 3-. 1.

.
: 3

30

,
, .
.1 , ,
[97]
.
.
.
A18
2010


: , , , .

, :



< >
, , .

.
, ,
,
, ?

< >
< >

1) 1

2) 13

3) 21

4) 39

.
,
: . ,
: 8 L8. ,
. : E1:E8, F7:F8, G1:G8,
H8, I1:I2, I8, J6:J8, M1:M8,
. : 39 .
: 39
31

,
.
. :
n, n - , n
.
m, m - , m
.
5 [1 2 ],
5 .
A23
2005

:
5 [ 10 72]
?
1)
2)
3)
4)

.

, ,
10 , ,
.
. ,
- 72 , ,
18072=108 ,
4

2.4. 2 ().

2.4.1.
: , , . 2
:
1) - ,
. 2009
2.(6-2006: , 6-2007, 6-2008: , 29-2004,
2-2009: );
.
2 - .
1
b := 0

c := 0
A6
2006


:
b = 11
: :=
.

32

c := c + b
b := b + 1

. ,
-. .
, .
, . : 3
1) 1
2) 45
3) 55
4) 66
c 0 0 1 3 6 10 15 21 28 36 45 55
b 0 1 2 3 4 5
6 7 8
9 10 11
, ,
-
A6
2008

m .
m := 54
n := 16

m=n

m>n

n := n - m

m := m - n

: := .
1) 1

2) 2

3) 6

4) 16

.
. .

1
2
3
4
5
6
7
8
: 2
33

m
54
38
22
6
6
6
2
2

n
16
16
16
16
10
4
4
2

m=n

m>n

m=m-n

m=m-n

m=m-n

n=n-m

n=n-m

m=m-n

n=n-m

, . 1.3.1, 6-2006 62008. 1 2009 .

2.4.2. .
5
.
2 - .
6 .
:
1) .
,
: 5-2009 ( ), 3-2005 ( ),3-2007, 32008 .
2) .
: 3-2006
( ), 3-2004 ( ), 5-2010, 2 (
).
, :
1. 3
2. 4
, 3,
, 4.
3 57,
6 , .
(, 21211
4
3
4
3
3
2 50.)
5
2009

. ,
. 57 3, ,
4, 4 3,
. !
, .
57-3=54, 4
54-3=51, 4
51-3=48, 4
48:4=12, 4
12:4=3, 5 .
, : 22111.
3*4*4+3+3+3=48+9=57.
: 22111
34

, :
1. 1
2. 3
1, .
3 16,
5 , .
(, 21211 )
3
1
3
1
1
1 4.)
B3
2005

. . ,

: , .
. 16 1, ,
3, , 1, 3
16+1+1=18, 3;
18:3=6, 3;
6:3=2; 1
2+1=3, .
, ,
: 12211. 5 , .
: 3(3-1=2)(2*3=6)(6*3=18)(18-1=17)(17-1=16)16.
.
: 12211
,
.
1(), 2(), 3(), 4(),
, .
, .
3
2006

3233241
,
, ,
, ?
. :
. , ,
, .
.
, . ,
3
2
.
:

3
3
2
,
.
1
4
,
:
414.
: 414
35

, .
: N ( N ); M
( M ). N M
. ,
50 , 2 12 , 3.
. ,
, ?

B3
2004

.
. .
3, 2 +12, 50
. 2+12=50, , =19.
:
19*( 3)= 57
(19+12)( 2)= 62
, : 5.
: 5
,
, , ,
. :

.
,
.

B5
2010
.2

.

. .
( ) .
. .

: 1

2.4.3. , .
8

2 - .
36

6
: ,
, .
8-2009 ( ), 6-2006, 6-2005, 24-2004 ( )
, . 6-2007, 6-2008
, (,
). .
( ) .
.
:
,
( i- i- ),
.
4 ,
(1)
(2) BAA
(3) CBAABAA
(4) DCBAABAACBAABAA
B8
2009

( ): ABCDEFGHIJKLMNOPQRSTUVWXYZ
, 126- 132-
( ).
.
d
1)
d=1
2) BAA
d=3
3) CBAABAA
d=7 di+1=2di+1
4) DCBAABAACBAABAA
d=15,
5) E - , d=31
6) F - , d=63
7) G - , d=127. 126 127 A
8) H - , ,
1, 126
B. .
:

126
127
128
129
130
131
132
B
A
A
G
F
E
D
( ) .
1.
:
, ,
,
. 4 ,
:
(1) 1
(2) 0 1 2
(3) -1 0 1 0 1 2 1 2 3
(4) -2 -1 0 -1 0 1 0 1 2 -1 0 1 0 1 2 1 2 3 0 1 2 1 2 3 2 3 4

B8
2010
.3
[9]

37

, 4374- (
).
:
, :
, . 8-
:
(1) 1
(2) 3
(3) 9
(4) 27
(5) 81
(6) 243
(7) 729
(8) 4374 8
, .. 4374 8. : 8
() :
B8
2008 1.
:
( i- i),
.
4 , :
(1)
1
(2)
211
(3)
3211211
(4)
432112113211211
1 ()?
.
. ,
, . : 1+2+4+8+16+32+64 =127.
: 127
() .
1.
:
( ,
), ( i-
i).
4 , :
(1)
1
(2)
112
(3)
1121123
(4)
112112311211234
B6
2007

(2, 4, 6, 8)?
. ,
,
.
.

1
2
3
4
5
6
7
8

0
1
2
5
10
21
42
85
38

: 85 .

3.
3.1. ,
3 ,

1.3
1.3.1.
1.3.2.
1.3.3

3.2. ,

2009 4.
:

22

39

- .

- - (.4

(.)
)

1.3.1.

1.3.2.

1.3.3.

1.3.2

10

24

1.3.2

3.3.
1
3.3.1. .
7
:
1) ,
, .
,
. : 7-2009, 9-2008 ( ),
9-2007, 9-2006, 9-2005. .
2)
,
. 11-2004 (
), 7=2010
:
.
3 - .
3
A9
2008

X
((X < 5) > (X < 3)) /\ ((X < 2) > (X < 1))

1) 1
2) 2
3) 3
4) 4
.

() . ,
, . ,
1) =1 ((1<5)->(1<3))/\((1<2)->(1<1))=(1->1)/\(1->0)=1/\0=0 ;
2) =2 ((2<5)->(2<3))/\((2<2)->(2<1))=(1->1)/\(0->0)=1/\1=0 ;
3) =3 ;
4) =4 .
2
A11
2004

:
( -> )?

1)

2)

3)

4)

.

() . ,
, . ,
1) - , .
(1->1)= 1=0. .
2) , . (0->0)=
1=0. .
40

3) . (1->0)= 0=1
4) .
3

3.3.2. .
. 8
:
, , .
: 8-2009, 10-2008 ( ), 10-2007, 10-2006, 102005, 12-2004. ,
, .
:
.
2 - .
1
,
(A \/ B \/ C)
/\ & ().
1) A \/ B \/ C
2) A /\ B /\ C
3) A \/ B \/ C
4) A /\ B /\ C
A10
2008

.
1) .
()
, .
: ((A \/ B) \/ C)
2) . : (A \/ B) & C
3) . : A & B & C
:
.
, , .
4

3.3.3. .
9
:
.
. , F.
: 9-2010, 9-2009, 11-2008 ( ), 112007, 11-2006, 11-2005, 13-2004. .
:
.
2 - .
2
A11
2008

F
X, Y, Z.
F:

X
1

Y
1

41

Z
1

F
1

1
1

1
0

0
1

1
1

F?
X \/ Y \/ Z
X /\ Y /\ Z
X /\ Y /\ Z
X \/ Y \/ Z

1)
2)
3)
4)

.
1) F1, .
,

X
1
1
1

Y
1
1
0

Z
1
0
1

F
1
1
1

F1
1
1
1

F2
1
0

F3

F4

F1()= 1 \/ 1 \/ 1 =1 \/ 0 \/ 1 =1
F2()= 1 /\ 1 /\ 1=1
F1()= 1 \/ 1 \/ 0 =1 \/ 0 \/ 1 =1
F2()= 1 /\ 1 /\ 0=0
F1()= 1 \/ 0 \/ 1 =1 \/ 1 \/ 1 =1
1 , .
F2.
1

3.4. . 2 ()

3.4.1. .
. 4
:
1) ,
. ,
.
: 4-2009, 2-2007 ( ).
2) - .
,
. : 4-2010, 2-2008 ( ),
2-2005;
3) - .
,
: 2-2006, 2-2004( ).
:
.
2 - .
10
B2
2007

X,
(90<XX) > (X < (X -1)) ?
.

42


. a=90<XX,
b=X < (X -1).
a
b
a->b b,
0, ..
0
0
1
.
0
1
1
(
1
0
0
). , ..
1
1
1
.
,
, = . =10 90<100= , =9 90<81=
.
: =9
4
2009

X,
(50<XX) (50>(X+1) (X+1))?

.
,
.
a=50<XX,
b=50>(X+1) (X+1). ,
, ,
: =7, = , = 8, = .
=7 =50<49= , b=50>64= , a->b= ,
. .
: = 7

2
((K \/ L) > (L /\ M /\ N)) = 0, K, L, M, N ?
2008
K, L, M N,
.

.
.
a= K \/ L, b= L /\ M /\ N. 0, , =1 b=0
(. 2-2007). 1,
. M N,
b=0. , 0,
0.
I. K=1, L=0
1) N=1, M=1
2) N=1, M=0
3) N=0, M=1
4) N=0, M=0
II. K=1, L=1
5) N=1, M=0
6) N=0, M=1
7) N=0, M=0
III. K=0, L=1
8) N=1, M=0
9) N=0, M=1
10) N=0, M=0
: 10
43

K, L, M, N,
(K \/ M)->(L \/ M \/ N) .
: K, L, M N ( ). ,
, 1101 , K=1, L=1, M=0, N=1
B2
2004

.
. a= K \/
M,
b= L \/ M \/ N. 0, , =1 b=0 (.
2-2007). 1,
.
I. K=1, M=0, =0
II. K=1, M=1, =0
III. K=0, M=1, =1
, 0,
0. M=0, L=0, , L=1, N=0. ,
M=0 K=0. ,
: K=0, L=1, M=0 N=0
: 0100

3.4.2. .
6
.
, .
:
1) : 4-2008 ( ), 4-2007, 4-2006
( ), 4-2005, 6-2010( 5)
2) , ,
,
. 4-2006,
3) . ,
.
6-2010, 1 [7],
:
.
2 - .
8

:
) , ;
) , ;
) , .
, ,
.
, , , ?
( .)
B4
2008

.
. .

44

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

)
)
)

1=

1=
3

2= 1=
3=
4=

, , .
: 3124
, (), () (),
,
. , ,
:
: ,
: , !
: , .
, ,
, , . ,
.
? .
B4
2006

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

45

, - , ,
, ,
3. . . ,
. , .
. : ,
=1 , , =0 .
, .
:
: , = & ;
: , != & ;
: , = & .
,
, , .
, 3
, .. .

& &
&

0 0
1
, ..
1
1
0

0 1
0
,
0
0
0


1 0
0
0
0
1

:
,
B6
3- , ,
2009 , , . ,
, , , , .
. ,
. .
: " . , ".
: " ". : ",
, ". , .
: " ", " ", " ".
(: , , : )
.
. ,
, , .
2 , , , . .
:
B6
2010
.

1)
2)
3)
4)
5)
6)
46

4 , 4 : , ,
. ,
: , , , ,
, , . , , :
.
.
.
.
.
.

7) .
8) .
, ,
, . , ( )
, , , :
.
:
;
, ;
( ,
), .
.

.
,
4 . ,
, .
:

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

(5)
(5)
(6)
(6)
(7)
(7)
(8) , ..

47

4.

4.1. ,
5 ,
:


1.4.1

1.4.2

(, , ,
)
1.4.3
(, ).
1.4.4

(, ,
)
, .
1.4

4.2. ,

10,
2009 .
2 .

4.3. . 1 ().
.
4.3.1.
(, , ,
). 10
:
1) (

).

. (12-2005 , 122006, ;
48

2) 4 .
: 12-2007 ;
3) .
: 12-2008
.
4) .
.
:
.
2 - .
2 .
A12
2005


. , .
A
A
B
C
D

B
4

4
5

D
5
6

3
6

1)

2)

3)

4)

1) =4;
2) D=5,
D=6.

1) =4;
2) D=5;

D=3,

1) =4;
2) D=5,
D=6,

1) =4
2) D=5;
3) =3;
4) D=6;

.
A, B, C, D .
: , ,
.
,
:
4 , D
5 ...

. ,
, .. . ,

4.
4
A12
2007
49

: ,
,

. ,
.
, :
B 6.

.

1)

2)

A
B
C
D

A B C D
3 1
4
2
3 4
2
1
2 2

3)

A
B
C
D

A B C D
3 1 1
4
3 4
2
1
1
2

A
B
C
D

4)
A B C D
3 1
4
1
3 4
2
1
1 2

A
B
C
D

A B C D
1
4
1
4
4 2
1
4
1 2

.

. ..
.
6, .

1. ,
6
A
C=3, S=3
B=4, S=7

D=1, S=1

E=2, S=5

C=3, S=3

B=2, S=7

A
AC=3, S=3

D=1, S=1

E=1, S=1

B=4, S=7

3 .
6

CB=4, S=7

2. 6,
, ..

4
:A-D-C-B
1+4+4=9

AD=1, S=1
CE=2, S=5
EB=1, S=6

3
, B, D.
80 , 50 ,
D 10 .
40 .
,
20 /, - 40 /?

A12
2008

50

1) 1

2) 1,5

3) 3,5

4) 4

.

.
:

1) 80 .

D
20 ./,
4 ;
2) 40
. 40 ./
1 .
, 50 ., 20 ./., 2,5 .
3,5 .
3,5 .
3
: , ,
, .

06:20
08:35

10:25
12:35

11:45
13:30

12:15
14:35

12:45
16:35

13:15
15:40

13:40
17:25

15:30
17:15

17:35
19:30

19:40
21:35
(00:00).
,
A10
2009

1) 15:40

2) 16:35

3) 17:15

4) 17:25

.
,
. .
.
, .
, 13:30.

, 17:25
, 17:15

51

, 21:35

, .
, . 17:25.
4

5.

5.1. ,
3 ,
:



2.1.1
,
.

2.1.2
(-,
.)
2.1.3
,
,
, ,

, 2004-2005 ..
.
, ,
.
2.1

5.2. . 1 ().
.
:
.
1-
1

52

A18
2004

1)
2)
3)
4)

1) 1

2) 2

3)

4)

.
,
.
,
. , ,
.
4
A19
2004

,
, ?

1)
2)
3)
4)

1) 1

2) 2

3)

4)

.
.
, . ,
,
.
4
A20
2004

-
?
B
A

53

1) A

2) B

3)

4)

.
,
.
4
A15
2005


?
A)
)
)
)
)
)
)
)

1)

2)

3)

4)

.
, .
.
, .. .
2

54

6.

6.1. ,
3 ,
:



2.2.1
:

2.2.2
( )
2.2.3
(
)
2.2.4.


(
)
2.2.5

( ,
.)
, 2004-2009 ..
. 2006
2.2.3.
2.2

55

6.2. . 1 ().
.
13,
2009 .

6.2.1. :

2004-2005 .. :
3) . (21-2004,
);
4) . (16-2005,
;
:
.
1-
1
.
, , ,
A21
,
2004
1)
2)
3)
4)

.
.
3
A16
2005
A)
)
)
)
)
)
)
)

8 .
? ( ,
)
Acrobat Reader
ASP Linux
IBM PC DOS
Macromedia Dreamweaver
Microsoft Office
Microsoft Windows
Norton SystemWorks
RealOne Player

1)

2)

3)

4)

.

, , , Microsoft , Windows
56

. : ASP Linux, IBM PC DOS, Microsoft Windows.


.
2

6.2.2. (
). 13
2004-2005 .. :
1) : 15-2004,
;
2) , : 22-2004,
;
3)
, : 17-2005,
; 15-2006,
4) ,
: 15-2007;
5) , : 152008, ; 13-2009,
:
.
1-
1

A15 ?
2004

1)

3)

2)

4)

.
,
, , ,
. 1,
, ( 0), . ,
, 0.
1
57

A22
2004

.
A:/

DOC3
Doc1
TOM3
Doc3

Doc3.
1)
2)
3)
4)

A:/DOC3
A:/DOC3/Doc3
A:/ DOC3/Doc1
A:/TOM3/Doc3

.
.
(),
, (
).
, .
.
, / \

.
4
5. ,
5,
:\9\\\5.
?
A17
2005

1)
2)
3)
4)

:\\\5
:\\5
:\9\\5
:\9\\5

.
. , , , , .. 5.
.
4
,

DOC, USER, SCHOOL, A:\, LETTER, INBOX.


,
. ,
?
A15
2007

1)
2)
3)
4)
58

A:\DOC
A:\ LETTER\INBOX
:\SCHOOL\USER\DOC
:\DOC\USER\SCHOOL

.
.
1. . DOC.
1, 3 4. 1 , ..
USER SCHOOL. 4.
2. A:\ .
, SCHOOL LETTER ,
DOC SCHOOL.
3
3
.
,
, :
? ( ) .
* ()
, * .
, :
?a???*
1) dad1
2) dad22
3) 3daddy
4) add444
A15
2008

.
.
, ?. ,
1 2, .
, . 1.
2, *
.
2

59

7.

7.1. ,
,
:
,
-

2.4

2.4.1
.
2.4.2
.
2.4.3
. , ,

2.4.4

2.4.5
: ,
,
, 2004-2009 ..
. , ..
.

7.2. . 1 ().
.
15,
.

60

7. 2.1. .
15
2004-2009 .. :
5) .
(21-2004, );
6) . ,
(172006, );
7) ,
(20-2005, , 17-2007, 17-2008
);
8) 24- RGB: (15-2009, )
:
.
1-
2
A26
2004
1)
2)
3)
4)

: 2
A17
2006

( ),
6464 , ,
256 .
.

1) 128

2) 2

3) 256

4) 4

.
,
,
. :
1) , 64*64 = 2 6 * 26 = 212
2) , ,
8 , .. 256 = 28
3) , .
, 8 = 1 . 2 12 *1 = 212 .
12
, , 1 = 210 210 =

212-10 = 22 = 4
: 4

61

A20
2005
1)
2)
3)
4)

128x128 4
.
?

8
2
16
4

.
:
1) 128*128 = 27 * 27 = 214
2) 4 = 4 * 210 =22 *210 = 212
3) 8 * 212 = 23 * 212 = 215
15
4) 214 = 2

5) 2 = 4
: 4

bgcolor="#",
24- RGB-.
, <body bgcolor="#FFFFFF">?
A15
2009

1)

2)

3)

4)

.

24- RGB-:

Red
Green
Blue

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1

1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1

1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0
256 .
.
: .
.
16-
. F16 = 11112. , FFFFFF = .
: 1

62

8.

8.1. ,
,
:
,
-

2.5

2.5.1
,
.
2.5.2
. .
. .

2.5.3
.

. 2004 2009
. .

63

8.2. ,

:

17
17

2009
16 , 17.
16

16

- .

- - (.4

(.)
)

2.5.1./
2.5.2.

2.5.3.

2009

8.3. . 1 ().
. 16
8.3.1.
.
2004-2009 .. :
1)
. : 27-2004, ;
2) . .
: 28-2004,
, 21-2005, , 18-2006, 18-2007
;
3) -
. . :
18-2008, ;
4) ,
. :
16-2009, .
5) .
( )
, :
: 16-2010
:
.
1-
1

64

A27
2004

A
5
10

1
2

B
2
1

C
4
6

D2 =2*1+1
D2 :
1) 6

2) 14

3)

16

4)

24

.
. 2, 1, 1
. D2 = 10*2+4=24.
: 4
A28
2004

1 =D1-$D2.
, 1 1?

1) =E1-$E2

2) =E1-$D2

3)

=E2-$D2

4)

=D1-$E2

.

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

D
E
=D1-$D2
1
2
,
.
, . =1-$D2.
: 2
A21
2005
65

C2 $E$3+D2. ,
C2 B1?
: $ .

1)
2)
3)
4)

$E$3+C1
$D$3+D2
$E$3+E3
$F$4+D2

.
, , .
.

1
2

=$E$3+D2

, .
: =$E$3+1, 1.
: 1
A18
2008

:
1
2

10
30

20
40

=A1+B$1

2, 1?
$ .
1) 40

2) 50

3) 60

4) 70

.
, 1
. . ,
,
. 1 2,
, .. . :
=2+B$1. 30+20=50, 2.
:
1) , ;
2) ;
3) .
: 2
A16
2009

=(B1:B2) 5.
B3, =(B1:B3) 3?

1) 8
2) 2
3) 3
4) 4
.
.

.
(B1:B2) 5 B1 + B2 = 5

(B1:B3) 3

(1+2+3)/3 = 3
.
(5+3)/3 = 3;
66

5+3 = 9;
3=4; 4.
: 4
()
( ) ( )
.
( )? ( .)
A16
2010

600
100
100
200

15600
2200
2400
6000

200
100
100
100

5200
2200
2400
3000

1000

26200

500

12800


300
7500
1200
31200
50
1100
250
5500
50
1200
200
4800
100
3100
350
10500
500

12900

2000

52000

1)
2)
3)
4)

:
1) : ,
, .
2) .
, 500
, 1000 2. :
26,2 /
25,6 /
25,8 /
26,0 /
3) , 26,2
: 1

8. 3.2.
. 17
2004-2009 .. :
1) .
. 4- : 22-2005,
, 19-2006, 19-2008 ;
2) . : 19-2007, ; 172009, .
:
.
2-
3
A22
2005
67

1
2
3
4

=B1+1
=A1+2
=B2-1
=A3

1
2

,
A1:A4. .
1)

2)

.

. :

3)

4)

2
1
1
4
2
2
1
3
1
4
.
.

. ,
,
. ,
. 1 3
, ..
.
( )
.
,
: .
(
). 4 90, 180, 45, 45
. 2.
2
(), ()
().
. I
, II .
.
A19
2007

68

I)

II)
45
40

35
30
25
20

15
10
5

0
2

:
)
)
)
)
?
1)
2)
3)
4)
.
,
. .
() . =25 2 +40 3
4 +15 5 = 100 .
=50, =25,
=25. .

+20

A. . 3 40
, 50 , 40 3 ,
- . .
B. .
25 , 3 - 40. .
C. . 25 , 5
15 . .
D. . 50 , 4
20 . .
.
: 1
(),
(), () .

A17
2009
200
180

160
140
120

100

69

80
60
40
20


?
1)

2)

3)

4)

180
160
180
520
43

120
140
120
380
32

120
60
120
300
25

1200
100

.
, 1 4.
, 1.
: 1

9. ,

9.1. ,
,
:
,
-

2.6
,

2.6.1
( )
2.6.2

70




. 2004 2009 ,
.
.
2.6.3
2.6.4

9. 2. ,
. 1 ().
. 14
2004-2009 .. :
1) .
(): 23-2004, , 18-2005, 162006, 14-2009, ;
2) .
: 30-2004, ;
3) . 4-
: 24-2005, ;
4) 4 .
:
16-2007,
;
5) . :
16-2008, ;
6) - .
, : 142010, .
7) - .
, : 142010, .
8)
:
.
2-
2
A23
2004


<=5 (>4 M>12) ( <=
)?

<=5

1- true
2- true
3- true
4- true
5- true
6- false
1) 5

>4

5-true
6-true
4-false
3-false
3-false
3-false

2) 2

:
71

3
0
1
6
3
2

1
3
4
0
3
4

M>12

9-false
5
13 - true
7
13- true
7
5-false
2
14- true 17
13- true
7

18
18
16
15
12
11
3)

4)

<=5 (>4
M>12) .
, ,
, .
.

, ,
0 false 1 true.
.

true (true false)


true (true) = true
true (true true)
true (true) = true
true (false true)
true (true) = true
true (false false)
true (false) = false
true (false true)
true (true) = true
false (false true)
false (true) = false
,
true.
: 4
A30
2004

10

135

195

11

45


?
1) 1

2) 2

3)

4)

:
,
, .,
. , ,
.
.
: 3
(
A24 ), ,
2005 : WinZIP ( ZIP), WinRAR
( RAR) StuffIt ( SIT). (
- ):

.mw2
72

296

ZIP
124

RAR
88

SIT
92

.mw2

932

24

20

28

, 1
WinZip 2 .
, :
( > 100) ( / ZIP > 2)
( > 100) (ZIP < 50)
( > 1024) ( / ZIP > 2)
( > 1024) ( / ZIP > 2)

1)
2)
3)
4)

:
, ,
. , ,
, , .
, 1 =1024 .
: ( > 1024) ( / ZIP > 2). 3.
: 3
A16
2007

:
, . ,
, . :

1 ,
2 3 .
, .
:
1)
.
2) .
3) +2+3
.
4) +2+3
.
:
,
.
= +2+3. (),
, .
: 3
:
A16 ,
2008 .
.
, ,
- 2- .
,
. ,
, .
:
73

, ..

..
77,1
150,0
3
..
79,1
147,5
1
..
78,2
147,5
2
..
78,2
147,5
2
..
79,5
150,0
1
..
77,1
147,5
1
( )?
1)
2)
3)
4)

200,0
202,5
200,0
202,5
200,0
200,0

2
1
1
3
1
1

..
..
..
..

:
.

1) ..
350
77,1
2) ..
350
79,1
3) .. 350
79,1
4) ..
350
79,5
, , ..
: 1
A14
2010


.:

10
10
10
50
150
150
200
200
250

I
III
II
I
II
I
III
I
I

I 10- ?
2) 2
3) 3
4) 4

1) 1

:
. 10 . I
, 10- .
.
2
A14
2010


. .

74

ID

D01
D02
D03
D04
D05
D06

. , . , 15
. , . , 17
. , . , 8
. , . , 6
. , . , 28
. , . , 4



, 24 .
, 4, 500
, 1000 .

60

001
D04
01002
002
D03
01002
003
D05
01002
004
D0l
02002
005
D04
02002
006
D04
01003
2-

01001
01002
01003
02001
02002

300
100
200
20
30
20
01003

5/01/2009

24
5
48
12
100

5
10
20
2
8

48

5/01/2009

5/01/2009
5/0112009

5/01/2009
6/01/2009

5 2009 .
1) 500

2) 1000

3)

2500

4)

1500

:
1)
2) ID ,

3) .1
.2 ID
4)

: 1

10.

10.1. ,
,
:
75



. .

2.7.2
: World Wide Web (WWW),
, , ,
.
2.7.3

2.7.4
(
HTML)
,
. 2.
2.7

2.7.1

10.2. ,

27

28

10

- .

- - (.4

(.)
)

2.7.1.

2.7.3.

10.3. 2
10.3.1.
,
:
9) ,
. 7-2005, 7-2006, 7-2007, 7-2008, 92010( 7) -
10) - IP ,
.
:
.
76

2 - .
3
9
2010
.7

://

www.com, http.txt,
ftp.
. ,
.

www
.txt
http
ftp
.com
/

:
:
:// / /
, :// / - .
, ,
: ftp :// http.txt / www.com.
:
:
9
2010
.7

.
, IP .
, , , . IP .
, ,
, IP .

.75

5.106

21

1.24

:
32 IP .
IP , . 1
0 255
: , .. 75
. ,
. 5
. , .
IP : 211.245.106.75, : .
:

10.3.2.
2005 :
1) .
. 8-2005, 8-2006, 8-2007, 8-2008,
10-2010 .
:
.
3 - .

77

5
.
,
.1
.

|, - &.

1
& &
2
| |
3
&
4
|
10
2010

:
.
. | ()

= {: }.
,
A, ,
.

|
,
, ,
, . | |
, .. .
. & ()

= { : }.
,
A, .
.
&
,
. & &
, ..
.
: 1342.
: 1342

11.
11.1. ,
3 ,

78

2.8
2.8.1.
2.8.2.
2.8.3


(30 50 )
( ).
(10
20 ) .
(30 50 )
(. . 1).

11.2. ,

:

29

30

31

32

3



.
(10
15 )






(3050 )

2.8.1.
2.8.2.

- .

- - (.4

(.)
)

30

1.2.4.
2.8.3.

30

1.2.1.

30

2.8.3

60

11.3.
,
. , ,
1, 2 4
79

11.3.1. 1.

: ,
, .
,
.
. ,
.
.
:
1) : 1-2008,
.
2) - : 12010( 10 [8]), .
3) - 1-2010 (. 5[8]),

4) - ,
. 1-2010 (.1 [7]), , 12010 (.3 [7]), , 1-2010, .
:
.
3 - .
30
1
2008

, a|x|=b
x a b, .
.
.


var a,b,x: real;
begin
readln(a,b,x);
if a = 0 then
if b = 0 then write (' ')
else write (' ')
else
if b = 0 then write('x = 0')
else write('x =',b/a,' x =',-b/a);
end.

:
80


INPUT a, b, x
IF a = 0 THEN
IF b = 0 THEN
PRINT " "
ELSE
PRINT " "
ENDIF
ELSE
IF b = 0 THEN
PRINT "x = 0"
ELSE
PRINT "x =",b/a, " x
=",-b/a
END IF
END IF
END


void main(void)
{float a,b,x;
scanf("%f%f%f",
&a,&b,&x);
if (a==0)
if (b==0)
printf(" ");
else
printf (" ");
else
if (b==0)
printf("x = 0");
else
printf("x=%f
x=%f", b/a,-b/a);
}

1) a, b, x,
.
2) ,
3) , ,
. ( ,
).
:
a|x|=b : |x|=b/a. |x|>0
, .
. ,
-.
a=0
b=0

b=0

x=0

b/a>0

x=b/a

.
1) . b/a<0, , =1, =-1
=-1, =1
2) readln(a,b,x);
readln(a,b);
3) , .
,
=.
readln(a,b);
if a = 0 then
if b = 0 then write(' ')
else write(' ')
else
if b=0 then write('x=0')
else
if b/a > 0 then write('x=',b/a, ' x=',-b/a)
else write(' ');
:
, .

81

1
2010
.10
[8]

, x2+c=0
x , .
.
.

var c,x: real;


begin
readln(c,x);
if c > 0 then
write (' ')
else
write('x =',sqrt(-c),' x =',-sqrt(-c);
end.

INPUT c, x
IF c > 0 THEN
PRINT " "
ELSE
PRINT "x =",SQR(-c), "
x =",-SQR(-c)
END IF
END

void main(void)
{float c,x;
scanf("%f%f ",
&c,&x);
if (c>0)
printf (" ");
else
printf("x=%f x=%f",
sqrt(-c),-sqrt(-c));
}

:
1) c, x,
.
2) ,
3) , ,
. ( ,
).
:

x2+c=0 : x2=-c.
x2>0
. c=0, =0,
. >0 c<0
. .
1) c, x, : =0,
=0..
2) ,
readln(c);
3) , .
var c,x: real;
begin
readln(c);
if c > 0 then write (' ')
else
if c=0 then write (x=0)
else write('x =',sqrt(-c),' x =',-sqrt(-c);
end.
, (ax)/(x+b)>0
x a
.5
b (a0, b0), .
[8]
. .
:
1) a, b, x,
.
82
1
2010

var a,b,x: real;


begin
readln(a,b,x);
if b = 0 then
write (x>0 x<0')
else
if a > 0 then write('x > 0 x <',-b)
else write(-b, <x<0);
end.

INPUT a, b, x
IF b = 0 THEN
PRINT "x>0 x<0"
ELSE
IF a > 0 THEN
PRINT "x >0 x<",-b
ELSE
PRINT -b, " < x <0
END IF
END IF
END

void main(void)
{float a,b,x;
scanf("%f%f%f",
&a,&b,&x);
if (b==0)
printf ("x>0 x<0");
else
if (a>0)
printf("x > 0
x<%f",-b);
else
printf("%f < x<0", -b);
}

2) ,
3) , ,
. ( ,
).
:
b=0, ax/x>0
, =0, >0, .
.
.
1) , b, : b=0,
a <0..
2) ,
readln(a,b;
3) , .
var a,b,x: real;
begin
readln(a,b);
if b = 0 then
if a>0 then write (x>0 x<0')
else write ( )
else
if a > 0 then write('x > 0 x <',-b)
else write(-b, <x<0);
end.
,

.1
(, )
[7]

.
1
2010

:
1) x ,
.
83

2) , ,
. ( ,
).

Var
x,y:real;
begin
readln(x,y);
if x*+x-y*y>=4 then
if y>=-2 then
if y<=x then
write()
else
write( );
end.


INPUT x,y
IF x*+x-y*y>=4 THEN
IF y>=-2 THEN
IF y<=x THEN
PRINT()
ELSE
PRINT( );
ENDIF
ENDIF
ENDIF
END


Void main(void)
{
float x,y;
scanf(%f%f,&x,&y);
if (x*+x-y*y>=4)
if (y>=-2)
if (y<=x)
printf();
else
printf( );
}

:
. ,

,
,
. 1.

.
,
2+2=4, = -2,
= >0,
. 2.
.
, .
.
1) , , :
=3, =1 (2+2>=4)(>= -2) ( <= ) (x>0);
2+2<4 < -2 ,
, .
2) , .
Var
x,y:real;
begin
readln(x,y);
if (x*+x-y*y>=4)and(y>=-2)and(y<=x)and(x<=0) then write()
else write( );
end.
,
.
1
2010
.3
[7]

84

,
(, )
.
.
:

1) x ,
.
2) , ,
. ( ,
).
, ,
,
.
.


Var
x,y:real;
begin
readln(x,y);
if y<=sin(x) then
if y>=1-x then
if y>=0 then
write()
else
write( );
end.


INPUT x,y
IF y<sin(x) THEN
IF y>= 1-x THEN
IF y>=0 THEN
PRINT()
ELSE
PRINT( );
ENDIF
ENDIF
ENDIF
END


Void main(void)
{
float x,y;
scanf(%f%f,&x,&y);
if (y<=sin(x))
if (y>=1-x)
if (y>=0)
printf();
else
printf( );
}

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

,
, . 1.
.
,
y=sin(x), = 1 - x, = 0 >, .
2.
. ,
.
.
1) , , :
= 5*/2, =0.5 (y<=sin(x))(>= 1-) ( >= 0) (x>=);
85

>sin(x) < 1-x ,


, .
2) , .
Var
x,y:real;
begin
readln(x,y);
if (y<=sin(x))and(y>=1-x)and(y>=0)and(x<=) then write()
else write( );
end.
,
(, )
.
.7
.
[7]
:
1) x ,
.
2) , ,
. (
,
).
1
2010


var ,:
real;
begin
readln (, ) ;
if y<=l
then
if >=
then
if <=2- then
if >=* then
writ('')
else
write (' ' )
end.


INPUT

IF
y<=l THEN
IF
>= THEN
IF <=2-
THEN
IF
THEN
>=*
PRINT
"!!
ELSE
PRINT
ENDIF
ENDI F
ENDIF

"

"


void main(void)
{ float
, ;
scanf("%f%f",&x,&y);

if
(y<=l)
if
(>=)
if
(<=2-)
if
(>=*)
ritf("") ;
else
lI
printf("He
) ;
}

ENDIF
END

:
,
,
.
, ,
.
else write (' '), ,
. 1.
. ,
.
=1 =0 =2-. ,
, - .
,
. 2.

1) : =1, =0. (,), : (y<x2 y2-x
y0) (y>1) (y<0) (y>2-)
2) : =0:
86

If (y>=x*x) and (y<=1) and (x<=0) or (x>=0) and (y>=0) and (y<=1) and (y<=2-x)
then writeln()
else writeln( );
. ,
, , ,
. .

11.3.2. 2. (10-15 )

2
,
.
, .
,
2
, 2 4
1) .
2) .
3) ,
.
4) .
5) .
.
6) .
, .
7)
, K.
8) .
9) , ,
.
10)
,
11)
.
12) ,
.
13)
.
14) ,
.
15) , .
:
.
2 - .
30

87

2
2010
.1
[8]

1) .


30 .
, .

Const
N=30
Var
A : array [1..n] of integer;
I, j, s : integer;
Begin
For I := 1 to n do readln(a[i]);
S:=0;
For I := 1 to n do
If a[i]<0 then s:=s+a[i];
If s=0 then writeln ( )
Else writeln(s);
End.

2
2010
.2
[8]


30 .

i, j, s--,
.
1 30
1 30 .
S=0
.
1- 30- :
,
-.
.

, S.

2) .


30 ,
.

Const
N=30
Var
A : array [1..n] of integer;
I, j, p : integer;
Begin
For I := 1 to n do readln(a[i]);
p:=1;
For I := 1 to n do
If a[i]<0 then p:=p*a[i];
writeln(p);
End.


30 .

i, j, p- ,
.
1 30
1 30 .
P=1
.
1- 30- :
,
,
,
.
.
.

3) ,
.
.5

[8]

30 ,
.
88
2
2010


Const
30 .
N=30

Var
i, j, s--,
A : array [1..n] of integer;

,
kI, j, s, k : integer;
,
Sa: real;

Begin
, Sa ..
For I := 1 to n do readln(a[i]);
1 30
S:=0; k:=0;
1 30 .
For I := 1 to n do
S=0, k=0
If a[i]<0 then begin
.
s:=s+a[i];
1- 30- :
k:=k+1;
,
end;
:
sa:=s/k;
Else writeln(sa:0:2);
s;
End.
k 1.
{
.
, .
, .. Sa= s/k
}
S.
4)
.
.1
28 .
[7]
0 100
.
40 .
,
, . ,
.
, .
, , .
2
2010

Const
N=28
Var
A : array [1..n] of integer;
I, j, min : integer;
Begin
For I := 1 to n do readln(a[i]);
...
End.

#include <stdio.h>
#define N 28
Void main(void)
89


28 .

i, j, min
1 28
1 28 .

N=28
DIM A(N) AS INTEGER
DIM I, j, MIN AS INTEGER

FOR I = 1 TO N
INPUT A(i)
NEXT i
...
END

int a[N];
int i, j, min;
for(i=0; i<N; i++)
scanf(%d, &a[i]);
...
}
(
), .
(
) -.
:
,
, .. ,
40 .
. min
. :
, 40,
.
:

Min:=100;
For i:=1 to n do
If (a[i]>=40)and(a[i]<min) then min:=a[i];
Writeln(min=,min);

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



min=100
1 28
Ai
40 min,

min

Ai

. min

MIN=100
FOR I = 1 TO N
IF A(i)>=40 AND A(i)<MIN THEN
MIN=A(i)
ENDIF
NEXT i
PRINT MIN

:

. .
5) .
.
.2
50 .
[7]
.
,
, .
, .
, , .
2
2010

90

(
), .
(
) -.
, .
.


Const
50 .
N=50
i, j
Var
1 50
A : array [1..n] of real;
1 50 .
I, j : integer;
i=1;
Begin
: I 50(
For I := 1 to n do readln(a[i]);
)
(a[i]>=0)
I:=1; {}

While (i<n)and(a[i]>=0) do i:=i+1;
(i=i+1)
If a[i]>=0 then writeln( )
,
Else writeln (i);
End.
: i-
,

#include <stdio.h>
N=50
#define N 50
DIM A(N) AS REAL
Void main(void)
DIM I, j AS INTEGER
{
FOR I = 1 TO N
float a[N];
INPUT A(i)
int i, j;
NEXT i
for(i=0; i<N; i++)
I=1
scanf(%d, &a[i]);
WHILE I<N AND A(I)>=0
for (i=0; i<N && a[i]>=0; i++);//
I=i+1;
If (a[i]>=0) printf( )
IF A(I)>=0 THEN
Else printf(%d,i);
PRINT
}
ELSE
PRINT I;
ENDIF
END
6) .
,
.
.4
30 .
[7]
. .

, , ,
, .
, .
, , .
(
), .
2
2010

91

(
) -.
, .
.


Const
30 .
N=30
i, j,
Var
x
A : array [1..n] of integer;
1 30
I, j, : integer;
1 30 .
Begin
.
For I := 1 to n do readln(a[i]);

J:=0;
I:=1; { }
, ,
While (i<n)and(a[i]<>x) do i:=i+1;
.
If a[i]<>x then writeln( )
:
Else writeln (i);
End.

{ , . ,
}
- ,
J:=0;
1. .
For i:=n downto 1 do
0,
If a[i] =x then j:=I;
j.
If j=0 then writeln( )
Else writeln(i);

#include <stdio.h>
#define N 30
Void main(void)
{
int a[N];
int i, j, x;
for(i=0; i<N; i++)
scanf(%d, &a[i]);
//
for (i=0; i<N && a[i] != x; i++);
If (a[i] != x) printf( )
Else printf(%d,i);
}

N=30
DIM A(N) AS INTEGER
DIM I, j, x AS INTEGER
FOR I = 1 TO N
INPUT A(i)
NEXT i
I = 1;
WHILE I<N AND A(I)<>x
I=I+1
IF A(I)<>x THEN
PRINT
ELSE
PRINT I
ENDIF
END

:
,
.
.
,
.
, .

92

7)
, K.
:
1) , ,
;
2) , K, ,
( );
3) ,
0.


Var a:array[1..1000] of integer;..{1}
DIM K,n,i,b,L,R, a(1000) AS INTEGER
K,L,R,m,i,n:integer;
INPUT K
b:boolean;
INPUT n
begin
FOR i = 1 TO n
readln(K);
INPUT a(i)
readln(n);
NEXT i
for i:=1 to n do read(a[i]);.{2}
b=1
b:=true;
FOR i = 2 TO n
for i:=2 to n do
IF a(i 1) >= a(i) THEN b = 0
if a[i-1]>=a[i] then b:=false;{3}
NEXT i
if not b then
IF b = 0 THEN
writeln( )
PRINT " "
else
GOTO 10
begin
{4}
END IF
L:=1; R:=n; ..{5}
L = 1: R = n
b:=false;{6}
b=0
while (L<=R)and not b do{7}
WHILE (L <= R) AND (b = 0)
begin
m = (L + R) \ 2
m:=(L+R)div 2;.{8}
IF a(m) = K THEN b = 1 ELSE b = 0
b:=(a[m]=K);.{9}
IF a(m) < K THEN
if a[m]<K then L:=m+1{10}
L=m+1
else R:=m-1
ELSE R = m 1
end;..{11} END IF
if b then writeln(m)
{12} WEND
else writeln(0)
IF b = 1 THEN PRINT m ELSE PRINT 0
end
10 END
end.
2
2004

: .
1) , ..
, .
2) n.
3) .
, b true.
4) .
5) L:=1; , R:=n; .
6) -, b=false , .
7) , ,
8) ;
9) , true,
;
93

10) ,
,
;
11) .
12) . 0, , ,
.
8) .
40 .
.
.5
,
[7]
(,
).
, .
, , .
(
), .
(
) -.
, .
.


Const
40 .
N=40
i, j,
Var
max-
,
max2-
A : array [1..n] of integer;

I, j, max, max2 : integer;


1 40
Begin
1 40 .
For I := 1 to n do readln(a[i]);
Max
.
Max:= a[1];
Max2
Max2:=a[2];
.
If max<max2 then begin
Max Max2
Max:=a[2];
: Max Max2,
Max2:=a[1];
Max
End;
, Max2
For i:=3 to n do
.
If a[i]>max then begin
.
Max2:=max;
3- 40 max,
Max:=a[i];
max,
End
Max2 Max, Max
Else
,
If a[i]>max2 then max2:=a[i];
, (
Writeln(max2);
End.
Max),
Max2.
Max2, Max2
. .
Max2

#include <stdio.h>
N=40
#define N 40
DIM A(N) AS INTEGER
Void main(void)
DIM I, j, max, max2 AS INTEGER
94
2
2010

{
int a[N];
int i, j, max, max2;
for(i=0; i<N; i++)
scanf(%d, &a[i]);
Max= a[1];
Max2=a[2];
If (max<max2){
Max=a[2];
Max2=a[1];
};
For (i=2;i< N;i++)
If (a[i]>max){
Max2=max;
Max=a[i];
}
Else
If (a[i]>max2) max2=a[i];
Printf(&d,max2);
}

FOR I = 1 TO N
INPUT A(i)
NEXT i
MAX=A(1)
MAX2=A(2)
IF MAX<MAX2 THEN
MAX=A(2)
MAX2=A(1)
ENDIF
FOR I=3 TO N
IF A(I)>MAX THEN
MAX2=MAX
MAX=A(I)
ELSE
IF A(I)>MAX2 THEN
MAX2= A(I)
ENDIF
ENDIF
NEXT I
END

9) ,
, .

, , 30
.
C3
2005


const N=30;
var a:array[1..N] of integer;
Max, Num, i: integer;
begin
{ }
Max:=a[1];
Num:=1;
for i:=2 to N do
begin
if a[i]>Max then
begin
Max:=a[i];
Num:=1;
end
else
if a[i]=Max then
Num:=Num+1;
end;
writeln(Num);
end.

95


N=30
DIM i, Max, Num, a(N) AS INTEGER
Max=a(1)
Num=1
LOOP
FOR i = 2 TO N
IF a(i)>Max THEN
Max=a(i)
Num=1
ELSE
IF a(i)=Max THEN
Num=Num+1
ENDIF
ENDIF
NEXT i
PRINT Num
END

10)

,


30 , ( ,
).
( ,
):

C2
2007



const N=30;
N=30
var a:array[1..N] of integer;
DIM i, MaxSum, MaxNum, a(N) AS INTEGER
MaxSum, MaxNum, i: integer;
MaxNum=1
begin
MaxSum=a(1)+a(2)
{ }
FOR i = 2 TO N-1
MaxNum:=1;
IF a(i)+a(i+1)>MaxSum THEN
MaxSum:=a[1]+a[2];
MaxNum=i
for i:=2 to N-1 do begin
MaxSum=a(i)+a(i+1)
if a[i]+a[i+1]>MaxSum then begin
ENDIF
MaxNum:=i;
NEXT i
MaxSum:=a[i]+a[i+1];
PRINT MaxNum
end
END
end;
writeln(MaxNum);
end.
.
MaxSum,
,
MaxNum, .
1
.
, , : ,
; ,
MaxSum , MaxNum
.
MaxNum.
11)



30
( ,
).
C2
2008

96

const N = 30;
var a:array[1..N] of integer;
MaxCoin, NumCoin, i: integer;
begin
{ }
MaxCoin: = 1;
NumCoin: = 1;
for i:= 2 to N do begin
if a[i]=a[i-1] then
NumCoin:=NumCoin+1;
else begin
if NumCoin> MaxCoin then
MaxCoin:=NumCoin;
NumCoin:=1;
end;
end;
if NumCoin> MaxCoin then
MaxCoin:= NumCoin;
writeln(MaxCoin);

N=30
DIM i, MaxCoin, NumCoin, a(N) AS INTEGER
MaxCoin = 1
NumCoin = 1
FOR i = 2 TO N
IF a(i) = a(i-1) THEN
NumCoin=NumCoin+1
ELSE
IF NumCoin>MaxCoin THEN
MaxCoin = NumCoin
END IF
NumCoin = 1
END IF
NEXT i
IF NumCoin>MaxCoin THEN
MaxCoin = NumCoin
END IF
PRINT MaxCoin
END

end.
.
MaxCoin
NumCoin
.
,
. , NumCoin .
,
MaxCoin; ,
MaxCoin .
NumCoin . .

MaxCoin , .
,
.
12) ,
.
40 .
.7
[7]
.
,
,
.
, .
, , .
(
), .
(
) -.
, .
.


2
2010

97

Const
N=40
Var
A : array [1..n] of integer;
I, k: integer;
Min, s:real;
Begin
For I := 1 to n do readln(a[i]);
S:=0;
For i:=1 to n do
S:=s+a[i];
S:=s/n;
K:=1;
For i:=2 to n do
If abs(a[i]-s)<abs(a[k]-s) then k:=I;
Writeln(k);
End.

#include <stdio.h>
#define N 40
Void main(void)
{
int a[N];
int i, j, max, max2;
for(i=0; i<N; i++)
scanf(%d, &a[i]);
Lmax=0;
L=1;
S=a[0];
For (i=1;i<N; i++)
If (a[i]>a[i-1]) {
L= L +1;
S=s+a[i];
}
Else {
If (l>lmax) {
Lmax= L;
Smax=s;
};
L=1;
98

40 .
i,
l- , lmax- ,
s- , smax-
.
1 40
1 40 .
: Lmax=0;
L=1; S=a[1]; -

: 2-
:

,
(L=L+1)

S=s+a[i],

: ( )

Lmax,
- Lmax
L Smax S.
L=1
S=a[i], .


, smax=s.
smax

N=40
DIM A(N) AS INTEGER
DIM I, j, max, max2 AS INTEGER
FOR I = 1 TO N
INPUT A(i)
NEXT i
LMAX=0
L=1
S=A(1)
FOR I=2 TO N
IF A(I)>A(I-1) THEN
L=L+1
S=S+A(I)
ELSE
IF L>LMAX THEN
LMAX=L
SMAX=S
ENDIF
L=1
S=A(I)
ENDIF
NEXT I

S=a[i];
};
If (l>lmax) smax=s;
Printf(%d,smax);
}

IF A(I)>LMAX THEN
SMAX=S
ENDIF
PRINT SMAX
END

: [7] .
13)
.
.8
40 .
[7]
.
,

.
, .
, , .
(
), .
(
) -.
, .
.


Const
40 .
N=40
i,
Var
l- , lmax- ,
A : array [1..n] of integer;
s-

,
I, l, lmax, s, smax : integer;
smax-

Begin
.
For I := 1 to n do readln(a[i]);
1 40
1 40 .
Lmax:=0;
: Lmax=0;
L:=1;
L=1; S=a[1]; -
S:=a[1];

For i:=2 to n do
: 2-
If a[i]>a[i-1] then begin
:
L:= L +1;

S:=s+a[i];
,

End
,

Else begin
(L=L+1)
If L>Lmax then begin

Lmax:= L;
S=s+a[i],

Smax:=s;
: ( )
End;

L:=1;
Lmax,
S:=a[i];
- Lmax
End;
L Smax S.
If L>Lmax then smax:=s;
L=1
Writeln(smax);
End.
S=a[i], .


2
2010

99


#include <stdio.h>
#define N 40
Void main(void)
{
int a[N];
int i, j, max, max2;
for(i=0; i<N; i++)
scanf(%d, &a[i]);
Lmax=0;
L=1;
S=a[0];
For (i=1;i<N; i++)
If (a[i]>a[i-1]) {
L= L +1;
S=s+a[i];
}
Else {
If (l>lmax) {
Lmax= L;
Smax=s;
};
L=1;
S=a[i];
};
If (L>Lmax) smax=s;
Printf(%d,smax);
}

, smax=s.
smax

N=40
DIM A(N) AS INTEGER
DIM I, j, max, max2 AS INTEGER
FOR I = 1 TO N
INPUT A(i)
NEXT i
LMAX=0
L=1
S=A(1)
FOR I=2 TO N
IF A(I)>A(I-1) THEN
L=L+1
S=S+A(I)
ELSE
IF L>LMAX THEN
LMAX=L
SMAX=S
ENDIF
L=1
S=A(I)
ENDIF
NEXT I
IF L>LMAX THEN
SMAX=S
ENDIF
PRINT SMAX
END

14) ,
.
.9
40 .
[7]
.
,
, .
, .
, , .
(
), .
(
) -.
8,
, .. .
, .
.


Const
40 .
N=40
i, j
Var
min- ,
A : array [1..n] of integer;
min2-

100
2
2010

I, j, min, s, min2 : integer;


Begin
For I := 1 to n do readln(a[i]);
min:=1;
min2:=2;
if a[min]>a[min2] then begin
min:=2;
min2:=1;
end;
For i:=3 to n do
If a[i]<a[min] then begin
Min2:=min;
Min:=i;
End
Else
If a[i]<a[min2] then
Min2:= i;
Writeln(min, min2);
End.

#include <stdio.h>
#define N 40
Void main(void)
{
int a[N];
int i, j, max, max2;
for(i=0; i<N; i++)
scanf(%d, &a[i]);
min=0;
min2=1;
if (a[min]>a[min2){
min=1;
min2=0;
};
For (i=2;i<N++)
If (a[i]<a[min]) {
Min2=min;
Min=i;
}
Else
If (a[i]<a[min2]) Min2:= i;
Printf(%d%d,min,min2);
}

.
1 40
1 40 .
: min=1;
Min2=2;
, .
: 3-
:

, :
min2 min ,
i.
,
,
min2 i.


min, min2

N=40
DIM A(N) AS INTEGER
DIM I, j, max, max2 AS INTEGER
FOR I = 1 TO N
INPUT A(i)
NEXT i
MIN=1
MIN2=2
IF A(MIN)>A(MIN2) THEN
MIN=2
MIN2=1
ENDIF
FOR I=3 TO N
IF A(I)<A(MIN) THEN
MIN2=MIN
MIN=I
ELSE
IF A(I) <A(MIN2) THEN
MIN2=I
ENDIF
ENDIF
NEXT I
PRINT MIN, MIN2
END

15) ,
.
.10
40 .
[7]
.
,
, .
2
2010

101

, .
, , .
(
), .
(
) -.
128,
, .. .
, .
.


Const
40 .
N=40
i, j
Var
min- ,
A : array [1..n] of integer;
min2-

I, j, min, s, min2 : integer;


.
Begin
1 40
For I := 1 to n do readln(a[i]);
1 40 .
: min=1;
min:=1;
Min2=2; s
min2:=2;

s:=abs(a[1]-a[2]);
.
For i:=1 to n-1 do
i: 1-
For j:= i+1 to n do

If abs(a[i]-a[j]<s then begin
j c i+1
Min:=i;
:
Min2:=j;

S:= abs(a[i]-a[j]);
s,
End

Writeln(min, min2);
End.
. i/
min, min2

#include <stdio.h>
N=40
#define N 40
DIM A(N) AS INTEGER
Void main(void)
DIM I, j, max, max2 AS INTEGER
{
FOR I = 1 TO N
int a[N];
INPUT A(i)
int i, j, max, max2;
NEXT i
for(i=0; i<N; i++)
MIN=1
scanf(%d, &a[i]);
MIN2=2
S=ABS(A(1)-A(2))
min=0;
FOR I=1 TO N-1
min2=1;
FOR J= TO N
s=abs(a[0]-a[1]);
IF ABS(A(I)-(J))<S THEN
For (i=0;i<N-1;i++)
MIN=I
For(j=i+1;j<n;j++)
MIN2=J
If (abs(a[i]-a[j])<s {
ENDIF
Min=i;
NEXT I
Min2=j;
NEXT J
}
PRINT MIN, MIN2
Printf(%d%d,min,min2);
}
END
102

11.3.3. 3.

, 2009
. :
1) ;
2) :
3) .
. ,
.
. ,
3 6 .
. . ,
.1
[7]
- , 2 -
. ,
24 .
, , , ?
? .
, ,
.
, ,
.
, 1,5
. ,
,
. ,

3
2010

=3
=6

1

+2,
5,6

2
2

7.6
1
,

2 ,
2

3
1

7,8

14,8

4
5
2
1

9,8
18,8

14,8

7,10
2
7,16
28,8 2

7,8
7,12


7,24 2

2,

103

6,6
2

5,8

7,8

10,6

20,6

5,12

5,24

8,6

10,6
16,6

20,6 2

+24

1 ,
1

12,6

6,12

8,8
16,8 2
12,8
24,8 2
6,10
6,16
6,24 1

3,8

5,8

7,8

2
,
1

6,8

, +2

8,12
8,8
16,8 2
24,6 1

6,8

3,16

10,8
5,10
5,16
8,8
12,8
6,10
6,16
3,32


1
20,8 2
5,20 2
5,32 2
16,8 2
24,8 2
6,20 2
6,32 2
1

3,10

, 2

3,12
2
,
1

3,24

5,10
5,20 2
1
6,10
3,20
3,12

. ,
. ,
- . :
(
3 ) .
:
1) 1 , 1 ;
2) 2 ;
3)

=3
=6

104


+2,
5,6

2
2

7.6

3
1


7,8

7,8

4
2

5
1

9,8
18,8

14,8

7,10
2
7,16

5,8
10,6
5,12
12,6
6,8
6,12

7,8

1
20,6
1
5,24
24,6 1
8,8

6,24 1

11.3.4. 4.
(30-50 )
4
, , ..
.
,
.
4
2.
,
4:
1) , .
2)
. : 5-2004
3) . 5-2004
4) . .
5) .
,
.
. 50% ,
val(<>,<>,< >)
. 5-2005 ( ), .
6) > >.
, , 0 48, 65,
a 97.
7) . 5-2005.
8) 4-2006 .
.
9) 4-2006 ( 4-2009) ,
.
.
repeat
read(c)
until c= ; { }

.
10) 4-2007 ,
.
.
11) 4-2010(176[11]) .

.
105

12) 4-2010(176[11])
.
13) C4 2010 179[11]
. .
14) C4 2010 179[11]
.
15) 2009-2010 .
text.dat ,
( . ).
,
,
, .
. ,
. , : It
is not a simple task. Yes! I, S T ( Yes
, ). ,
, : I 3
:
,
4.
.
,
. - , 26, 1
26, a z( ) A Z( ).
:
a) a:array['A'..'Z'] of integer;
b) a:array[1..26] of integer;
,
()
upcase(c);

: [A] A , [1], [A]= [1]
..
C5
2004

:

var
a:array['A'..'Z'] of integer;
c, cmax: char;
begin
assign(input,'text.dat');
reset(input);
for c:='A' to 'Z' do a[c]:=0;
repeat
read(c);
c:= upcase(c);
if c in ['A'..'Z'] then
a[c]:=a[c]+1
until c='.';
cmax := 'A';
for c:= 'B' to 'Z' do
106

{1}{3}

{2}
{3b}
{3c}

{4}


var a:array[1..26] of integer;
{3a}
c: char;
i, kod, number, imax :integer;
begin
assign(input,'text.dat');
{2}
reset(input);
for i:=1 to 26 do a[i]:=0;
{3b}
repeat
{3c}
read(c);
{ }
kod:= ord(c);
{ }
if c in ['A'..'Z'] then begin
number:=kod-64; a[number]:=a[number]+1;
end;
{ }
if c in ['a'..'z'] then begin
{}
number:=kod-95; a[number]:=a[number]+1

end;
{ }
until c='.';
imax := 1;
{4}
for i:= 2 to 26 do
if a[i] > a[imax] then imax := i;
writeln(chr(imax)+64, a[imax],)
end.

, .
.
if a[c] > a[cmax] then
cmax := c;
writeln(cmax,' ',a[cmax])
end.

: ..
1) .
. , ..
1.
2) input output

.

read readln, write writeln
. - output
,
close(output).
3)
a)
,
b)
(!)
c)
, :

['A'..'Z'],
a[c] 1.
4)
meteo.dat 365 ,
2003 .
: dd.mm (
,
),
, 1 .
, .
,
(), ()
.
.
: , ,
.
: 12 2 4


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];
tm
C5
2005

107

max,ty,t:real;
,
i:integer;
m
begin
,
assign(input,'meteo.dat');
{1}
data ,
reset(input);
max
for i:=1 to 12 do
{2}

tm[i]:=0;
,
ty:=0;
ty ,
for i:=1 to 365 do begin
,
readln(data,t);
{3}
t
m[i]:=(ord(data[4])-ord('0'))*10
{4}
.
+ord(data[5])-ord('0');

tm[m[i]]:=tm[m[i]]+t;
, .
ty:=ty+t;
:
end;
tm ty.
for i:=1 to 12 do

tm[i]:=tm[i]/d[i];
, ,
ty:=ty/365;
12 ,
max:=0;
{5}
,
for i:=1 to 12 do

if abs(tm[i]-ty)>max then
.
max:=abs(tm[i]-ty);
{6}

writeln(ty:0:2);

for i:=1 to 12 do

if abs(tm[i]-ty)=max then
{7}
.

writeln(m[i],' ',tm[m[i]]:0:2,' ',tm[m[i]]


ty:0:2)
.
end.
:
1)
input.
2) , ..
.
3) readln(data,t);
: ,
.
,
,
.
4)
, val(a,s,code)
s.
5) max .
6)
.
7) .
:
( 9), ( 9),
( 5).
.
N, K (K < N) .
108
C4
2006

N : <> <1>
<2> <3>, <> , , 20 ,
0 . (
, , ,
. , 2, ). :
8 9 3
2 0 0
,
,
, . ( ,
,
, K ,
1 ) , , ,
.
:
0 23 , 9 - .



var m:array[0..23] of integer;

c:char;
, m[23]

i, K, N, S, m1, m2, m3:integer;


,
begin
23 ..
assign(input,'abitur.dat'); reset(input);
,
readln(N); readln(K);
,
for i:=0 to 23 do m[i]:=0;
, 24
for i:=1 to N do begin

repeat
,
read(c)
( 0 23).
until c= ; { }

readln(m1, m2, m3); { }
,
if (m1<3)or(m2<3)or(m3<3) then s:=0
, 0.
else s:=m1+m2+m3;

m[s]:=m[s]+1 {
, 23-,
, } K.
end;

s:=m[23]; i:=23;
while:
while s+m[i-1]<=K and (i>9) do begin
,
i:=i-1;

s:=s+m[i]
.
end;
,
if (s<K)and(i>9) then

writeln( , m[i-1],

)
.
else writeln( ); K ,
readln

end.
.
,
(, K ).

109

9-
. N,
10, 100, N
: <> <> <>, <> ,
20 , <> , 15
, <> ,
. <> <>, <> <>
. :
4 5 4
,
. ,
, , .
.


var p:array[1..100] of record

name:string;
,
sum:integer;
.
end;
,
c:char;
,
i,j,N,s1,s2,s3,m:integer;
(
begin
),
readln(N);

for i:=1 to N do begin
(
p[i].name:='';

repeat
,
read(c);
).
p[i].name:=p[i].name+c
,
until c=' '; { }
.
repeat

read(c);
.
p[i].name:=p[i].name+c

until c=' '; { }

p[i].sum:=0;
,
for j:=1 to 3 do
.
begin
read(m);
p[i].sum:=p[i].sum+m
end; { }
readln; { }
end;
s1:=0; s2:=0; s3:=0;
for i:=1 to N do begin
if p[i].sum>s1 then begin
s3:=s2; s2:=s1;
s1:=p[i].sum
end else
if p[i].sum>s2 then begin
s3:=s2; s2:=p[i].sum
end else
if p[i].sum>s3 then s3:=p[i].sum;
end; { }
for i:=1 to N do { }
110
C4
2007

if p[i].sum>=s3 then writeln(p[i].name);


end.
: ,
(, ).
,
. :
176[10]
, ( 00 21 ) (
00 59 ).
N, 10, 1000. N
: <>< >
<> - , 20 , <
> - , :
( 00 21 ) ( 00 59
). . .
, ,
,
.
:
10:00
3
12:00
10:00
12:15




type

pp: record

name:string;

time:integer;
.
end;
,
var
2-
p:array[1..1000] of pp;
.
q:pp;
.
c, c1:char;

i,j,N,time1:integer;
time1.
begin

readln(c,c1);{ }
.
time1:=60*((ord(c)-48)*10+ord(c1)-ord(0);

readln(c,c,c1);{ ,
.
}
,
time1:=tyme1+60*((ord(c)-48)*10+ord(c1)-48;

readln(N);

j:=1;

C4
2010

111

for i:=1 to N do begin{


}
p[j].name:='';
repeat
read(c);
p[j].name:=p[j].name+c
until c=' '; { }
readln(c,c1);{ }
p[j].time:=60*((ord(c)-48)*10+ord(c1)-48;
readln(c,c,c1);{ }
p[j].time:= p[j].time+60*((ord(c)-48)*10+ord(c1)-48;
if (p[j].time>=time1)and(p[j].time<=time1+120) then
j:=j+1;{ }
end;
N:=j-1;{ }
for j:=1 to N-1 do
for j:=1 to N-i do
if p[j].time>p[j+1].time then begin
q:=p[j];
p[j]:=p[j+1];
p[j+1]:=q;
end; { }
for i:=1 to N do
writeln(p[i].name);
end.

,
2 .

.

,


.
,

2
.

, 200
, (
179[10]
). .
,
(
, ,
20 ).
, ( ,
Z), .
, .
,
. , :
Zb Ra Ca Dab Ra.
:
Bl Tc Ec Fcd Tc
: ,
, .. ,
.



var
.
S: string;
.
f:Boolean;
min
112
C4
2010

c, cnew:char;
i,k,min:integer;
begin
s:=;
min:=250;{ }
k:=0;
f:=false; { }
repeat { }
read(c);
s:=s+c;
if f then { }
if c in [a..z, A..Z] then k:=k+1
else begin
if k<min then min:=k;
f:=false;
end
else {f=false }
if c in [a..z, A..Z] then begin
f:=true;
k:=1;
end;
until c=.;
for i:=1 to length(s) do begin
cnew:=chr(ord(s[i])+min);
case s[i] of
a..z: if cnew>z then writeln (chr(ord(cnew)-26))
Else writeln(cnew);
A..Z: if cnew>Z then writeln (chr(ord(cnew)-26))
Else writeln(cnew);
Else writeln (s[i])
End;
End;
end.

250,
,
.
f
false.
,
, f=false
.

0, ..
.


.
.

,
.
,


min .
( ),
, ,

.


. case
.

,
,
.


, .
,
7[7]
.
, 20%
( , ).
, , .
, 20%
, , 20%.
( 20%
) - .
, ,
( , Borland Pascal 7.0),
, ,
. , 5- .
, , .
, .
113
C4
2010

N :
<> <> < > < >
<> - , 30 , <> , , 20 , < > -
1 99, < > - l 100.
, ( ,
).
:
50 87
:
78



var
4-2006
k:array[0 .. 100] of integer; { ,
.
}
,
ch:char;
,
i,N,sh,ball,num,s:integer;
,
begin
.
for i:=0 to 100 do k[i]:=0; { }
.
readln (N); { }
,
for i:=l to N do begin {
k.
}

repeat
.
read(ch)
20%
until ch=' '; { }
,
repeat
.
read(ch)
,
until ch=' '; { }
,
readln(sh,ball); {

}
,
k[ball]:=k[ball]+l { , .
}
,
end;
20%.
num:=N div 5; { 20%
.
}
20% ,
s:=0;
,
i:=l0l;
.
while s<num do begin
,
i:=i-1;
snum, .
s:=s+k[i]
, 20%
end;

if s=num then {""
(k[i]=s),
20% } writln(i)
.
else
, .
if k[i]=s then { 20%
} writeln(i)
k, .
else begin {, "i" ,
""}
i:=i+1;
while k[i]=0 do i:=i+1; {
}
114

writeln(i)
end
end.
[7].

, .
2 () ,
8 [7]
40 . 3 () 30%
, , 60 .
30%,
4 ( 3 -).
, ,
( , Borland Pascal 7.0),
, ,
, . ,
50- . ,
, .
, .
N :
<> <> < > < >
<> - , 30 , <> , , 20 , <' > -
1 99, < > - 1 100,
, nv ( .
, ).
:
50 87
:
45 703



Var
4k: array[0 .. 100 ] f intgr;{ ,
2006
}
.
ch:char;
,

i,N,sh,ball,num,s:lnteger;

begin
,
for i: =0 to 100 do k [i] : =0; { }

readln (N); { }

for i:=1 to N do begin {


, ,
}

repeat
.
read(ch)
until ch=' '; {
repeat
read(ch)
until ch=' '; { }
readln(sh,ball); {
}
C4
2010

115

k[ba11] :=k[ball]+1 { ,
}
end;
s:=0;
for i:=0 to 40 do
s : =s+ k [i] ; { ,
"2"}
um:=(N-s) *30 div 100; { 30% ,
"2"}
s:=0;
i:=40;
while (s<num) and (i<60) do begin {
" 3"}
i:=i+1;
s:=s+k[i]
end;
if s=num then writeln(i, , s) { 3
30% ,
2}
else
if (i=60) and (s<num) then writeln ( '60 , s) {
60 }
else {"" 30%}
if s=k[i] then writeln(i,' ',s) { "" '
}
else begin
s:=s-k[i];
i:=i-1; { }
while k[i]=0 do i:=i-1;
writeln(i,' ',s)
end
end.

, (
,
, ).
, , (
, , Borland Pascal 7.0),
, , .
, ,
( , ).
, - ,
.
,
"NO". , "YES",
- . ,
. , :
Do not 91 L to 09 do.
YES
91019
C4
2011

116



var

a:array[ '0' .. '9']

, _odd: char;

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

}
9 (
for := '0' to '9' do
,
if [ ] mod 2 - 1 then begin
- ), 8
k := k + 1;
.. 0, ,
_odd :=

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

,

(, ,
255 ),
,
.

. , .

, .
,
, , .

1. 2004
2. 2005
3. 2006
117

2007
2008
2009
: 2010:
/ .-. .., ... .: : , 2010. 190, .
( )
8. 2010. . / .., ..,
... .: , 2010. 141 . ( 2010.
)
9. .. . . :
- . .: , 2010. 182
10. ( ) 2010
. .: , 2010. 172
11. 2010
12. 20110
4.
5.
6.
7.

118