Äîêóìåíò âçÿò èç êýøà ïîèñêîâîé ìàøèíû. Àäðåñ îðèãèíàëüíîãî äîêóìåíòà : http://www.schools.keldysh.ru/sch1019/ege2013/Zadanie_INF11_15022013.pdf Äàòà èçìåíåíèÿ: Sat Jan 5 01:59:06 2002 Äàòà èíäåêñèðîâàíèÿ: Fri Feb 28 08:17:39 2014 Êîäèðîâêà: Ïîèñêîâûå ñëîâà: m 13

(): () , (http://www.fipi.ru) 9 (11) , . () , . , , . . , , . , , (. ).


. 11 . 1

m00324

2

2 15 2013 11
235 . 3 , 32 . 1,5 (90 ) 1 2, ­ 3. 1 13 (1­13). , 2 15 (1­15). . 3 4 (1­4). . . , . , . , . , , . , , , . . !

1

. ( ). .

© 2013 .

© 2013 .


. 11

.

1

3

. 11

.

1

4

1

1 ( 1­ 13) . 1. a) b) /\ ) c) \/ ) d) e) ); f) 0­ 2. ( . \/ 3. ( ( 4. ), ). /\ \/ 1 \/ /\ /\ ­ ( ), , , : ( ( , ¬ /\ \/ /\ D ( /\ ) /\ . ( \/ ) \/ . = 1024 ;1 = 1024 (¬ ) \/ = 1, , = 0). ), ), ((¬ ) /\ ) \/ ( . A ). 1) 13 A3 x1 0 1 0 x2 1 0 1 x3 0 1 0 x4 1 1 1 x5 1 0 0 x6 1 0 1 x7 0 1 0 2) 16 3) 18 F: x8 1 1 0 x9 1 1 1 x10 1 0 0 F 1 1 0 Z( 4) 27 , 1 ( , ). ,
A B C D E F Z

«X» . :

,

A1 , , A2

4

,

( ( ( &( ( |( ( , , | ); ) , ( , & ); , ( ); , ) ,

): ¬( ) ) , ); , ( ); , , ¬ ); /\ ( \/ (

10001011, 10111000, 10011011, 10110100. , 1) 1 2) 2 , A416 +208? 3) 3

4) 4 ,

A, B, C, D, E, F, Z ( ).
A 4 6 B 4 1 2 4 27 11 20 2 5 C 6 1 D E F Z 27 20 5

2 4

11 2

/\ D). :

1 2 3 4

) ) ) )

x1/\¬x x1\/¬x ¬x1\/x ¬x1/\x

2/ 2\ 2\ 2/

\ / / \

x3/\¬ x3\/¬ ¬x3\/ ¬x3/\

x4 x4 x4 x4

/ \ \ /

\x5/\¬x /x5\/¬x /¬x5\/x \¬x5/\x

6/\ 6\/ 6\/ 6/\

F? x7/\x8/\¬x9/\x10 x7\/x8\/¬x9\/x10 ¬x7\/¬x8\/x9\/¬x10 ¬x7/\¬x8/\x9/\¬x10

©

2013 .

©

2013 .


. 11

.

1

5

. 11

.

1

6

A4 , , : «?» ( . «*» ( , . 6 omerta.doc chimera.dat chimera.doc izmeren.doc mesmer.docx k-mer-list.doc , : omerta.doc chimera.doc izmeren.doc k-mer-list.doc : ) «*» )

.

A6 .. 1 ID 107 102 109 117 115 106 113 106 121 120 102 104 104 118 109 111 ... 1) 3) 2 8 9 8 6 5 1 1 7 2 7 0 6 7 3 0 ... .. .. D5 3x+y, , 1) =3* 22+D22 3) =3*C$22+D$22 A8 16 48 ? 1) 1 . C4. x­ C22, y­ _. . . . . . .. .. .. .. . . . .. .. .. .. . . . . . . ID_ 1027 1027 1028 1028 1072 1072 1072 1099 1099 1110 1110 1131 1131 1131 1187 1187 ... 2) 4) .. .. . C4 2 ID_ 1072 1099 1072 1099 1040 1202 1217 1156 1178 1156 1178 1040 1202 1217 1061 1093 ...

.

. . .

...

1) *mer?*.d* 3) *?mer*?.do* A5

2) ?mer*.doc 4) *mer?.doc* . , , ­ . ). . A7

D22.

. ( . : : 70. , 1) 131 . 2) 133 3) 212 4) D1 , , 3. : ­ =010;

D5. 2) =3*$C22+$D22 4) =3*D$22+$D23 ( ) . . , 2) 2 . 3) 3 . 4) 4 . -

A­3=1010­310=710.

24,

©

2013 .

©

2013 .


. 11

.

1

7

. 11

.

1

8

A9

, . ­ 00000, ­ 00111, ,, ­ 11011. 5: .

4

:,,, :

A12

0 10. , . s=0 n = 10 FOR i = 0 TO n IF A(n-i)-A(i) > A(i) THEN s = s+A(i) END IF NEXT i s:=0; n:=10; for i:=0 to n do begin if A[n-i]-A[i] > A[i] then s:=s+A[i]; end;

. , ? 1) 11111 3) 00011 2) 11100 4)

A10 A, ( (x , . 1) [5, 20] 2) [10, 25] )

: P = [3, 13]

Q = [7, 17].

(x P) ) \/ ¬(x Q) 1 3) [15, 30] 4) [20, 35]

s = 0; n=10; for (i = 0; i <= n; i++) if(A[n-i]-A[i] > A[i]) s=s+A[i]; s:=0 n:=10 i 0 n A[n-i]-A[i] > A[i] s:=s+A[i]

0, 10, 20, A11 1, 3. ( ). , 30 1) 180 . 2) 210 3) 240 4) 270 30, 40, 50, 60, 70, 80, 90, 100, s 1) 60 2) 100 . . A[0]=0, A[1]=10 3) 150 .. ? 4) 550

,

15

, , , 2, 0,

©

2013 .

©

2013 .


. 11

.

1

9

. 11

.

1

10

A13 : , :

,« , 8

» . ­ .
2

( 1­ 15) , , , : B1 1. 2. , . 3. . , 1211 ­ 2 3 2 2 ) , . , , ( F6)? , 2( , , , . , . : , 5 . , , 2 12 , 2, 3. . 1 , , . ,

, , , .

:

2, ­

­

1 2 1( )

16. 122

1) 6

2) 14

3) 18

4) 30

©

2013 .

©

2013 .


. 11

.

1

11

. 11

.

1

12

B2 ( .

c ). a = 30 b=6 a=a*3/b IF a < b THEN c = 2*a - 5 * (b+2) ELSE c = 2*a + 5 * (b+2) END IF a := 30; b := 6; a := a * 3 / b; if a < b then c := 2*a - 5 * (b+2) else c := 2*a + 5 * (b+2); a = 30; b = 6; a = a * 3 / b; if (a < b) c = 2*a - 5 * (b+2); else c = 2*a + 5 * (b+2); a := 30 b := 6 a := a * 3 / b a
B3 1 2

A 2 =B1/A1 ( ? .

B = C1/B1 ). B1,

C =A1*4 =B2+A1

A2: 2

, . :

,

,

B4 . . .) ( : , )? ( ,

, ,

B5

, ( DIM N, S AS INTEGER N=0 S=0 WHILE S <= 365 S = S + 36 N=N+5 WEND PRINT N

):

:

©

2013 .

©

2013 .


. 11

.

1

13

. 11

.

1

14

var n, s: integer; begin n := 0; s := 0; while s <= 365 do begin s := s + 36; n := n + 5 end; write(n) end. #include void main() { int n, s; n = 0; s = 0; while (s <= 365) { s = s + 36; n = n + 5; } printf("%d", n); }

B6 : F(1) = 1; F(2)=1; F(n) = F(n­2) * (n­1), . : B7 1007 + x = 2005. ( ). : B8 4a b. . n >2. F(7)?

F(n),

n­

,

x, x,

n, s n := 0 s := 0 s <= 365 s := s + 36 n := n + 5 n :

6, 5. DIM X, A, B AS INTEGER INPUT X A=0: B=0 WHILE X > 0 A = A+2 B = B +(X MOD 10) X = X \ 10 WEND PRINT A PRINT B var x, a, b: integer; begin readln(x); a:=0; b:=0; while x>0 do begin a:=a + 2; b:=b + (x mod 10); x:=x div 10; end; writeln(a); write(b); end.

©

2013 .

©

2013 .


. 11

.

1

15

. 11

.

1

16

#include void main() { int x, a, b; scanf("%d", &x); a=0; b=0; while (x>0){ a = a+2; b = b +(x%10); x = x/10; } printf("%d\n%d", a, b); }

B9 H, K, L, M. . M?

,

A, B, C, D, E, F, G, , A

x, a, b x a:=0; b:=0 x>0 a:=a+2 b:=b+mod(x,10) x:=div(x,10) a, : ,b

: B10 : ) ) , , ­ ­ ­ ? , . . , « : , 23. », « .», « .» 23 . , , , , , ; 30% , ­ 18 , ; ­2 220 , . ; 10

©

2013 .

©

2013 .


. 11

.

1

17

. 11

.

1

18

B11 , ­ , IP: IP. A 255 . A 128 : B12 « » «&». IPB 168 B 254 : IP-

TCP/IP IP. . IP. .

, ,

B13 1. 2. 3. ­ , : B14 , ( ). 1, 3. 1

, , . 2

:

IP224.24.254.134 255.255.224.0

15?

C 244

D 224

E 134

F 24

G 8

H 0

192.168.128.0 C D 255 8

E 127

F 0

G 17 HBAF.

H 192

DIM A, B, T, M, R AS INTEGER A = -20: B = 20 M = A: R = F(A) FOR T = A TO B IF F(T) > R THEN M=T R = F(T) END IF NEXT T PRINT M FUNCTION F(x) F = 16*(9+x)*(9+x)+127 END FUNCTION var a,b,t,M,R :integer; Function F(x: integer):integer; begin F := 16*(9+x)*(9+x)+127; end; BEGIN a := -20; b := 20; M := a; R := F(a); for t := a to b do begin if (F(t) > R) then begin M := t; R := F(t); end; end; write(M); END.

«|», . ( &( & & & ( , , . , ) & ? | ) 338 204 50

« »­

)

,

:

©

2013 .

©

2013 .


. 11

.

1

19

. 11

.

1

20

#include int F(int x) { return 16*(9+x)*(9+x)+127; } void main() { int a, b, t, M, R; a = -20; b = 20; M = a; R = F(a); for (t=a; t<=b; t++){ if (F(t) > R) { M = t; R = F(t); } } printf("%d", M); }

B15 x2, x3, x4, x5, y1, y2, y3, y4, y5, ? (x1 x2) /\ (x2 (y1 y2) /\ (y2 x5 y5 =1 x3) /\ (x3 y3) /\ (y3 x4) /\ (x4 x5 ) = 1 y4) /\ (y4 y5 ) = 1

x1,

x1, x2, x3, x4, x5, y1, y2, y3, y4, y5, . :

.

3

2. a, b, t, R, M a := -20; b := 20 M := a; R := F(a) t a b F(t) > R M := t; R := F(t) M F( x) C1 ( ). ,

(1 .

( 1­ 4) . .),

.

(x, y ­

)

:= 16*(9+x)*(9+x)+127 :

©

2013 .

©

2013 .


. 11

.

1

21

. 11

.

1

22

: INPUT x, y IF x*x + y*y <= 25 THEN IF y <= 4-x*x THEN IF y <= x+1 THEN PRINT " " ELSE PRINT " END IF END IF END IF END x, y x, y x*x + y*y <= 25 y <= 4-x*x y <= x+1 ' '

"

' '

var x, y: real; begin readln(x, y); if x*x + y*y <= 25 then if y <= 4-x*x then if y <= x+1 then write(' ') else write(' ') end. #include void main(){ float x, y; scanf("%f %f",&x, &y); if (x*x + y*y <= 25) if (y <= 4-x*x) if (y <= x+1) printf(" else printf(" }

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

y, . , A, B, C, ... W). 3­ , . . ( x : y. , ) (

,

1 2 3 (x*x + y*y <= 25) (y <= 4­x*x) (y <= x+1) "); "); . 1. , . , . 2. , ( ). , , , « » , , . --

©

2013 .

©

2013 .


. 11

.

1

23

. 11

.

1

24

C2

, , , .

70 , .

. , . , N=70 a[1:N] i, j, x, y i 1 a[i] ...

N

const N=70; var a: array [1..N] of integer; i, j, x, y: integer; begin for i:=1 to N do readln(a[i]); ... end. N=70 DIM A(N) AS INTEGER DIM I, J, X, Y AS INTEGER FOR I = 1 TO N INPUT A(I) NEXT I ... END #include #define N 70 void main(){ int a[N]; int i, j, x, y; for (i=0; i
, . ( , , Free Pascal 2.4) . .

©

2013 .

©

2013 .


. 11 . 1

25

. 11 . 1

26

3

, , . . , . . , 10 , 11 50 . , , . , 100. , , , 101 . S , 1 S 100. , , . ­ , , . . . 1. ) S ? . ) S, , . . 2. S, , , , . S . 3. S, ­ , , ­ , . S . , . . , , ­ .

5. , . 6. , . , . , : , . , , , . , . . N ­ . N ( , 100 ) ( ). , . , 3. , . : 9 69485 Jack 95715 qwerty 95715 Alex 83647 M 197128 qwerty 95715 Jack 93289 Alex 95715 Alex 95715 M : 1 . qwerty (197128) 2 . Alex (95715) 3 . Jack (95715)

4

«-» . 1. . . 2. . . ( ) . 3. . . 4. , .

© 2013 .

© 2013 .


. 11 . 2

m00324

2

2 15 2013 11
235 . 3 , 32 . 1,5 (90 ) 1 2, ­ 3. 1 13 (1­13). , 2 15 (1­15). . 3 4 (1­4). . . , . , . , . , , . , , , . . !

2

. ( ). .

© 2013 .

© 2013 .


. 11

.

2

3

. 11

.

2

4

1

1 ( 1­ 13) . 1. a) b) /\ ) c) \/ ) d) e) ); f) 0­ 2. ( . \/ 3. ( ( 4. ), ). /\ \/ 1 \/ /\ /\ ­ ( ), , , : ( ( , ¬ /\ \/ /\ D ( /\ ) /\ . ( \/ ) \/ . = 1024 ;1 = 1024 (¬ ) \/ = 1, , = 0). ), ), ((¬ ) /\ ) \/ ( . A ). 1) 15 A3 x1 0 1 0 x2 1 0 1 x3 0 1 0 x4 1 1 1 x5 1 0 0 x6 1 0 1 x7 0 1 0 2) 17 3) 19 F: x8 1 1 0 x9 1 1 1 x10 1 0 0 F 0 0 1 Z( 4) 21 , 1 ( , ). , ( );
A B C D E F Z

«X» . :

,

A1 ,

4

,

( ( ( &( ( |( ( , , | ); ) , ( , & ); , ( ); , ) ,

): ¬( ) ) , ); A2 , , , ¬ ); /\ ( \/ (

10101011, 11001100, 11000111, 11110100. , , 1) 1 2) 2 , BC16 +208? 3) 3

4) 0 ,

A, B, C, D, E, F, Z ( ).
A 4 9 B 4 3 2 4 21 11 20 4 2 C 9 3 D E F Z 21 20 4 2

2 4

11

/\ D). :

1 2 3 4

) ) ) )

x1/\¬x x1\/¬x ¬x1\/x ¬x1/\x

2/ 2\ 2\ 2/

\ / / \

x3/\¬ x3\/¬ ¬x3\/ ¬x3/\

x4 x4 x4 x4

/ \ \ /

\x5/\¬x /x5\/¬x /¬x5\/x \¬x5/\x

6/\ 6\/ 6\/ 6/\

F? x7/\x8/\¬x9/\x10 x7\/x8\/¬x9\/x10 ¬x7\/¬x8\/x9\/¬x10 ¬x7/\¬x8/\x9/\¬x10

©

2013 .

©

2013 .


. 11

.

2

5

. 11

.

2

6

A4 , , : «?» ( . «*» ( , . 6 corvin.doc escorte.dat esccorte.doc record.docx score5.docx side-core.doc , : esccorte.doc record.docx score5.docx side-core.doc : ) «*» )

.

A6 . .( 1 ID 107 102 109 117 115 106 113 106 121 120 102 104 104 118 109 111 ... 1) 3) 2 8 9 8 6 5 1 1 7 2 7 0 6 7 3 0 ... .. .. B11 x­3y, , 1) = 22 3*D22 3) =C$22­3*D$22 A8 . A10. x­ C22, y­ B11. 2) =$C22­3*$D22 4) =D$22­3*$D23 ( 16 ? 1) 25 2) 35 243) 45 . 4) 55 ) ­ . . . . . . ID_ 1027 1027 1028 1028 1072 1072 1072 1099 1099 1110 1110 1131 1131 1131 1187 1187 ... 2) 4) .. .. . A10 ). 2 ID_ 1072 1099 1072 1099 1040 1202 1217 1156 1178 1156 1178 1040 1202 1217 1061 1093 ...

.

_. . . . . . .. .. .. .. . .. . .. .. .. ..

. .

...

1) *cor?*.d* 3) *?cor*.do* A5

2) ?cor*.doc 4) *cor?.doc* . , , ­ . ( ). . A7

.

D22.

. : B, 3, 3. , 1) 122 . 2) 212 3) 313 4) 3A : B­3=810; 3­3=0. : 08.

©

2013 .

©

2013 .


. 11

.

2

7

. 11

.

2

8

A9

, . ­ 11111, ­ 11000, ,, ­ 00100. 5: .

4

:

,,, :

A12

0 10. , s=0 n = 10 FOR i = 0 TO n IF A(n-i)-A(i) > A(i) THEN s = s+A(i) END IF NEXT i s:=0; n:=10; for i:=0 to n do begin if A[n-i]-A[i] > A[i] then s:=s+A[i]; end; .

. , ? 1) 00000 3) 00011 2) 11100 4)

A10 A, ( (x , . 1) [2, 22] 2) [3, 13] )

: P = [5, 15]

Q = [11, 21].

(x P) ) \/ ¬(x Q) 1 3) [6, 16] 4) [17, 27]

s = 0; n=10; for (i = 0; i <= n; i++) if(A[n-i]-A[i] > A[i]) s=s+A[i]; s:=0 n:=10 i 0 n A[n-i]-A[i] > A[i] s:=s+A[i]

0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, . . A[0]=0, A[1]=2 .. s ? 1) 12 2) 20 3) 30 , 0, 1, 3. 15 ( ). , 25 1) 150 . 2) 175 3) 200 4) 225 , , , 2, 4) 110

A11

©

2013 .

©

2013 .


. 11

.

2

9

. 11

.

2

10

A13 : , :

,« , 8

» . ­ .
2

( 1­ 15) , , , : B1 1. 2. . , . . , 12211 ­ 2 2 2 1( ) , , , , . , , ( F6)? , . , 5 . : . ) 2( , , , 1 1 , 2, . . 1 , , . ,

, , , .

:

2, ­

­

1 2

85. 123

1) 6
© 2013 .

2) 10

3) 13

4) 18
© 2013 .


. 11

.

2

11

. 11

.

2

12

B2 ( .

c ). a = 30 b=6 a=a*3/b IF a < b THEN c = 2*a - 5 * (b+3) ELSE c = 2*a + 5 * (b+3) END IF a := 30; b := 6; a := a * 3 / b; if a < b then c := 2*a - 5 *(b+3) else c := 2*a + 5 * (b+3); a = 30; b = 6; a = a * 3 / b; if (a < b) c = 2*a - 5 * (b+3); else c = 2*a + 5 * (b+3); a := 30 b := 6 a := a * 3 / b a
B3 1 2

A 5 =B1/5 ( ? .

B =A1/B1 ). B1,

C =A1*2 =B2+C1/10

A2: 2

, . :

,

,

B4 . . .) : , ( )? ( ,

, ,

B5

, ( DIM N, S AS INTEGER N=0 S=0 WHILE S <= 365 S = S + 36 N = N + 10 WEND PRINT N

):

:

©

2013 .

©

2013 .


. 11

.

2

13

. 11

.

2

14

var n, s: integer; begin n := 0; s := 0; while s <= 365 do begin s := s + 36; n := n + 10 end; write(n) end. #include void main() { int n, s; n = 0; s = 0; while (s <= 365) { s = s + 36; n = n + 10; } printf("%d", n); }

B6 : F(1) = 1; F(2)=1; F(n) = F(n­2) *(n­1), . : n >2. F(8)?

F(n),

n­

,

B7

608 + x = 1007. ( ). : 4 a b. 6, 9. DIM X, A, B AS INTEGER INPUT X A=0: B=0 WHILE X > 0 A = A+2 B = B +(X MOD 10) X = X \ 10 WEND PRINT A PRINT B var x, a, b: integer; begin readln(x); a:=0; b:=0; while x>0 do begin a:=a + 2; b:=b + (x mod 10); x:=x div 10; end; writeln(a); write(b); end. . x, x,

B8

n, s n := 0 s := 0 s <= 365 s := s + 36 n := n + 10 n :

©

2013 .

©

2013 .


. 11

.

2

15

. 11

.

2

16

#include void main() { int x, a, b; scanf("%d", &x); a=0; b=0; while (x>0){ a = a+2; b = b +(x%10); x = x/10; } printf("%d\n%d", a, b); }

B9 H, K, L, M. . M?

,

A, B, C, D, E, F, G, , A

x, a, b x a:=0; b:=0 x>0 a:=a+2 b:=b+mod(x,10) x:=div(x,10) a, : ,b

: B10 : ) ) , , ­ ; ­ ­ ? , . . , « : , 23. », « .», « .» 23 . , , , , , 20% , ­ 18 , ; ­2 220 , . ; 5

©

2013 .

©

2013 .


. 11

.

2

17

. 11

.

2

18

B11 , ­ , IP: IP. A 255 . A 128 IPB 168 B 249 IP-

TCP/IP IP. . IP. .

, ,

B13 1. 2. 3. ­ , : B14 , ( ). 1, 3. 1

, , . 7

:

IP: 224.37.249.32 255.255.224.0

20?

C 240

D 224

E 37

F 32

G 8

H 0

192.168.128.0 C D 255 8

E 127

F 0

G 17 HBAF.

H 192

: B12 « » «&». «|», . ( &( & & ( , , . : , & ) & ? , | ) 427 222 50 ) « »­

DIM A, B, T, M, R AS INTEGER A = -25: B = 25 M = A: R = F(A) FOR T = A TO B IF F(T) > R THEN M=T R = F(T) END IF NEXT T PRINT M FUNCTION F(x) F = 15*(5+x)*(5+x)+125 END FUNCTION var a,b,t,M,R :integer; Function F(x: integer):integer; begin F := 15*(5+x)*(5+x)+125; end; BEGIN a := -25; b := 25; M := a; R := F(a); for t := a to b do begin if (F(t) > R) then begin M := t; R := F(t); end; end; write(M); END.

©

2013 .

©

2013 .


. 11

.

2

19

. 11

.

2

20

#include int F(int x) { return 15*(5+x)*(5+x)+125; } void main() { int a, b, t, M, R; a = -25; b = 25; M = a; R = F(a); for (t=a; t<=b; t++){ if (F(t) > R) { M = t; R = F(t); } } printf("%d", M); }

B15 x2, x3, x4, x5, y1, y2, y3, y4, y5, ? (x1 x2) /\ (x2 (y1 y2) /\ (y2 y5 x5 =1 x3) /\ (x3 y3) /\ (y3 x4) /\ (x4 x5) = 1 4) /\ (y4 y5) = 1

x1,

x1, x2, x3, x4, x5, y1, y2, y3, y4, y5, . :

.

3

a, b, t, R, M a := -25; b := 25 M := a; R := F(a) t a b F(t) > R M := t; R := F(t) M F( x)

2. C1 ( ). ,

(1 .

( 1­ 4) . .),

.

(x, y ­

)

:= 15*(5+x)*(5+x)+125 :

©

2013 .

©

2013 .


. 11

.

2

21

. 11

.

2

22

: INPUT x, y IF x*x + y*y <= 25 THEN IF y <= 4-x*x THEN IF y <= x+1 THEN PRINT " " ELSE PRINT " END IF END IF END IF END x, y x, y x*x + y*y <= 25 y <= 4-x*x y <= x+1 ' '

"

' '

var x, y: real; begin readln(x, y); if x*x + y*y <= 25 then if y <= 4-x*x then if y <= x+1 then write(' ') else write(' ') end. #include void main(){ float x, y; scanf("%f %f",&x, &y); if (x*x + y*y <= 25) if (y <= 4-x*x) if (y <= x+1) printf(" else printf(" }

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

y, . , A, B, C, ... W). 3­ , . . ( x : y. , ) (

,

1 2 3 (x*x + y*y <= 25) (y <= 4­x*x) (y <= x+1) "); "); . 1. , . , . 2. , ( ). , , , « » , , . --

©

2013 .

©

2013 .


. 11

.

2

23

. 11

.

2

24

C2

, , , .

70 , .

. , . , N=70 a[1:N] i, j, x, y i 1 a[i] ...

N

const N=70; var a: array [1..N] of integer; i, j, x, y: integer; begin for i:=1 to N do readln(a[i]); ... end. N=70 DIM A(N) AS INTEGER DIM I, J, X, Y AS INTEGER FOR I = 1 TO N INPUT A(I) NEXT I ... END #include #define N 70 void main(){ int a[N]; int i, j, x, y; for (i=0; i
, . ( , , Free Pascal 2.4) . .

©

2013 .

©

2013 .


. 11

.

2

25

. 11

.

2

26

C3

, .

, , . 11 , 50 , , , S 101 ,1 S . .

. . 10 , , . 100. , . , . . . S . S, ? ­ , ,

5. . 6. . ,

, , . , : , , , . . . N­ N ( ( . , 3. , . : , ). , 100 . ) , , .

, 100.

,

1. ) ) , 2. S,

. . , , , S . . S, , , , . S , . , , « » . . . ) . . , . 1 2 3
©

3. ­ ­

. . ­ . .

C4 1. . 2. ( 3. 4.

9 69485 Jack 95715 qwerty 95715 Alex 83647 M 197128 qwerty 95715 Jack 93289 Alex 95715 Alex 95715 M : . qwerty (197128) . Alex (95715) . Jack (95715)
2013 .

.

©

2013 .