Демоверсии ЕГЭ-2016: информатика и ИКТ

2016 . , 11 . (2016 - 1 / 54)

2016

2016 . , 11 . (2016 - 2 / 54)

2016

2016 . , , , , 2016 . , 2016 ., 2016 . .

, , , . , , .

.

2016 . , 11 . (2016 - 3 / 54)

2016

, 27 . 1 23 . 2 4 .

3 55 (235 ).

123 , . , 1.

: 23 . 2427 . 2

. .

, , . .

. , , .

.

!

2016 . , 11 . (2016 - 4 / 54)

. 1. (): a) (, ) (, ); b) ( , ) /\

(, /\ ) & (, & ); c) ( , ) \/

(, \/ ) | (, | ); d) () (, ); e) (, A B). A B , A B ( , ); f) 1 ( ); 0 ( ). 2. , , (), . , () \/ , \/ /\ ( , , = 1, = 0). 3. : (), ( ), ( ), (), . , /\ \/ /\ D , (() /\ ) \/ ( /\ D). /\ /\ ( /\ ) /\ . : \/ \/ ( \/ ) \/ . 4. , .

2016 . , 11 . (2016 - 5 / 54)

1 123 , , 1 , , , . .

12F016?

: ___________________________.

F (z)/\x \/ x/\y. , F x, y, z.

. 1 . 2 . 3 ??? ??? ??? F

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

x, y, z , ( , 1- ; , 2- ; , 3- ). , . . x y, x y, :

. 1 . 2 ??? ??? F

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

1- y, 2- x. : yx.

: ___________________________.

1

2

2016 . , 11 . (2016 - 6 / 54)

- , ( ).

, . , . , .

: ___________________________.

. , (.. ) .. 1.

1 2 ID _.. ID_ ID_

2146 .. 2146 2302 2155 .. 2146 3002 2431 .. 2155 2302 2480 .. 2155 3002 2302 .. 2302 2431 2500 .. 2302 2511 3002 .. 2302 3193 2523 .. 3002 2586 2529 . 3002 2570 2570 .. 2523 2586 2586 .. 2523 2570 2933 .. 2529 2431 2511 .. 2529 2511 3193 .. 2529 3193

: ___________________________.

3

4

2016 . , 11 . (2016 - 7 / 54)

. , , : ? ( ) . * () , * . 6 : maveric.map maveric.mp3 taverna.mp4 revolver.mp4 vera.mp3 zveri.mp3 . , ?

*ver*.mp* *?ver?*.mp? ?*ver*.mp?* *v*r*?.m?p* ???*???.mp* ???*???.m* *a*.*a* *a*.*p*

: ___________________________.

, : , , , ; , . , , : : 111, : 0, : 100. , . , .

: ___________________________.

5

2016 . , 11 . (2016 - 8 / 54)

N. R .

1. N. 2. :

) , 2 (). , 11100 111001; ) 2.

( , N) R. N, 125. .

: ___________________________.

, : 1. 2, 2. 5. , 2, , 5. , 2121 5, 2, 5, 2, 1 37. , 2 24 . .

: ___________________________.

6

2016 . , 11 . (2016 - 9 / 54)

. E4 D3 . . D3?

D E 1 40 4 400 70 7 2 30 3 300 60 6 3 20 2 200 5 4 10 1 100 40 = $B2 * C$3

: $ .

: ___________________________.

.

A B C 1 6 10 2 = (A1 3)/(B1 1) = (A1 3)/(1 5) = C1/(A1 3)

A1, , A2:2, ? , .

: ___________________________.

7

2016 . , 11 . (2016 - 10 / 54)

, . .

Python DIM S, N AS INTEGER S = 0 N = 0 WHILE S < 111 S = S + 8 N = N + 2 WEND PRINT N

s = 0 n = 0 while s < 111: s = s + 8 n = n + 2 print(n)

n, s n := 0 s := 0 s < 111 s := s + 8 n := n + 2 n

var s, n: integer; begin s := 0; n := 0; while s < 111 do begin s := s + 8; n := n + 2 end; writeln(n) end.

#include int main() { int s = 0, n = 0; while (s < 111) { s = s + 8; n = n + 2; } printf("%d\n", n); return 0; }

: ___________________________.

8

2016 . , 11 . (2016 - 11 / 54)

( ) , 6464 , 256 ? , .

: ___________________________.

, . 24 . ( ) 4 1,5 , . . , . , .

: ___________________________.

, . 5- , , , , 1 . . ?

: ___________________________.

9

10

2016 . , 11 . (2016 - 12 / 54)

(): F G. Python DECLARE SUB F(n) DECLARE SUB G(n) SUB F(n) IF n > 0 THEN G(n - 1) END SUB SUB G(n) PRINT "*" IF n > 1 THEN F(n - 3) END SUB

def F(n): if n > 0: G(n - 1) def G(n): print("*") if n > 1: F(n - 3)

F( n) n > 0 G(n - 1) G( n) "*" n > 1 F(n - 3)

procedure F(n: integer); forward; procedure G(n: integer); forward; procedure F(n: integer); begin if n > 0 then G(n - 1); end; procedure G(n: integer); begin writeln('*'); if n > 1 then F(n - 3); end;

void F(int n); void G(int n); void F(int n){ if (n > 0) G(n - 1); } void G(int n){ printf("*"); if (n > 1) F(n - 3); } F(11)?

: ___________________________.

11

2016 . , 11 . (2016 - 13 / 54)

TCP/IP , , IP- , . , IP-, , . ( ) , . IP- . , IP- 231.32.255.131, 255.255.240.0, 231.32.240.0.

IP- 111.81.208.27 111.81.192.0. ? .

: ___________________________.

, 15 12- : , , C, D, , F, G, H, K, L, M, N. . , . , , ; . 20 400 . ? .

: ___________________________.

12

13

2016 . , 11 . (2016 - 14 / 54)

. , v w . ) (v, w). v w. , (111, 27) 05111150 0527150. v, (v, w) . ) (v). , v . , , . .

, .

1 2

1 ( ) 2 ( ).

, 68 8? .

(222) (888) (222) (222, 8) (888, 2)

: ___________________________.

14

2016 . , 11 . (2016 - 15 / 54)

, , , , , , , , , , , , . , . ?

: ___________________________.

: 98 + 35 9 3. 2 ?

: ___________________________.

15

16

2016 . , 11 . (2016 - 16 / 54)

|, &. .

( ) & 200

& ( | ) 470 & 355

( ) & & ? , , , , .

: ___________________________.

m&n m n. , , 14&5 = 11102&01012 = 01002 = 4.

x&25 0 (x&17 = 0 x& 0) (.. 1 )?

: ___________________________.

17

18

2016 . , 11 . (2016 - 17 / 54)

A 0 9. 4, 7, 3, 8, 5, 0, 1, 2, 9, 6 , .. A[0] = 4, A[1] = 7 .. c ( ).

Python c = 0 FOR i = 1 TO 9 IF A(i) < A(0) THEN c = c + 1 t = A(i) A(i) = A(0) A(0) = t ENDIF NEXT i

c = 0 for i in range(1,10): if A[i] < A[0]: c = c + 1 t = A[i] A[i] = A[0] A[0] = t

c := 0 i 1 9 A[i] < A[0] c := c + 1 t := A[i] A[i] := A[0] A[0] := t

c := 0; for i := 1 to 9 do if A[i] < A[0] then begin c := c + 1; t := A[i]; A[i] := A[0]; A[0] := t; end;

c = 0; for (i = 1;i < 10;i++) if (A[i] < A[0]) { c++; t = A[i]; A[i] = A[0]; A[0] = t; }

: ___________________________.

19

2016 . , 11 . (2016 - 18 / 54)

. x, M. , x > 100. (.. 100) x, 26.

Python DIM X, L, M AS INTEGER INPUT X L = X M = 65 IF L MOD 2 = 0 THEN M = 52 ENDIF WHILE L M IF L > M THEN L = L M ELSE M = M L ENDIF WEND PRINT M

x = int(input()) L = x M = 65 if L % 2 == 0: M = 52 while L != M: if L > M: L = L - M else: M = M - L print(M)

x, L, M x L := x M := 65 mod(L,2)=0 M := 52 L M L > M L := L M M := M L M

var x, L, M: integer; begin readln(x); L := x; M := 65; if L mod 2 = 0 then M := 52; while L M do if L > M then L := L - M else M := M L; writeln(M); end.

20

2016 . , 11 . (2016 - 19 / 54)

#include void main() { int x, L, M; scanf("%d", &x); L = x; M = 65; if (L % 2 == 0) M = 52; while (L != M){ if(L > M) L = L - M; else M = M - L; } printf("%d", M); }

: ___________________________.

k, , k = 10. . Python DIM K, I AS LONG INPUT K I = 1 WHILE F(I) < G(K) I = I + 1 WEND PRINT I FUNCTION F(N) F = N * N * N END FUNCTION FUNCTION G(N) G = 2*N + 3 END FUNCTION

def f(n): return n*n*n def g(n): return 2*n+3 k = int(input()) i = 1 while f(i) < g(k): i+=1 print (i)

21

2016 . , 11 . (2016 - 20 / 54)

i, k k i := 1 f(i) < g(k) i := i + 1 i f( n) := n * n * n g( n) := 2*n + 3

var k, i : longint; function f(n: longint): longint; begin f := n * n * n; end; function g(n: longint): longint; begin g := 2*n + 3; end; begin readln(k); i := 1; while f(i) < g(k) do i := i+1; writeln(i) end.

#include long f(long n) { return n * n * n; } long g(long n) { return 2*n + 3; } int main() { long k, i; scanf("%ld", &k); i = 1; while(f(i)

2016 . , 11 . (2016 - 21 / 54)

15 . , : 1. 1 2. 2 1, 2. 15 . , 2 29 14 25? . , 121 7 8, 16, 17.

: ___________________________.

x1, x2, ... x9, y1, y2, ... y9, ? ( (x1 y1)) (x2 y2) ( (x2 y2)) (x3 y3) ( (x8 y8)) (x9 y9) x1, x2, ... x9, y1, y2, ... y9, . .

: ___________________________. 1 .

22

23

2016 . , 11 . (2016 - 22 / 54)

2

(2427) 2. (24, 25 . .), . .

, 109. , , 7. , 7, 0. . .

Python DIM N, DIGIT, SUM AS LONG INPUT N SUM = 0 WHILE N > 0 DIGIT = N MOD 10 IF DIGIT < 7 THEN SUM = SUM + 1 END IF N = N \ 10 WEND PRINT DIGIT

N = int(input()) sum = 0 while N > 0: digit = N % 10 if digit < 7: sum = sum + 1 N = N // 10 print(digit)

N, digit, sum N sum := 0 N > 0 digit := mod(N,10) digit < 7 sum := sum + 1 N := div(N,10) digit

var N, digit, sum: longint; begin readln(N); sum := 0; while N > 0 do begin digit := N mod 10; if digit < 7 then sum := sum + 1; N := N div 10; end; writeln(digit) end.

24

2016 . , 11 . (2016 - 23 / 54)

#include int main() { int N, digit, sum; scanf("%d", &N); sum = 0; while (N > 0) { digit = N % 10; if (digit < 7) sum = sum + 1; N = N / 10; } printf("%d",digit); return 0; } . 1. , 456. 2. , . 3. ( ). , . :

1) , ; 2) , , .. .

. , , , , . , .

2016 . , 11 . (2016 - 24 / 54)

20 . 10 000 10 000 . , , 3. . , : 6; 2; 9; 3; 6 : 4. , . , , .

Python CONST N AS INTEGER = 20 DIM A (1 TO N) AS INTEGER DIM I AS INTEGER, J AS INTEGER, K AS INTEGER FOR I = 1 TO N INPUT A(I) NEXT I ... END

# # # j k a = [] n = 20 for i in range(0, n): a.append(int(input())) ...

N = 20 a[1:N] i, j, k i 1 N a[i] ...

const N = 20; var a: array [1..N] of integer; i, j, k: integer; begin for i := 1 to N do readln(a[i]); ... end.

25

2016 . , 11 . (2016 - 25 / 54)

#include #define N 20 int main() { int a[N]; int i, j, k; for (i = 0; i

2016 . , 11 . (2016 - 27 / 54)

. 2015. 10 000. 1000. , , . - , 6 . , 1. , : . . . , , 0 . , . . , , . . , . 2 . . , , ( ). , N, .. N k k . , , , N 1 . . , . , , 4 . , , , 3 .

27

2016 . , 11 . (2016 - 28 / 54)

! , . . N . , N > 6. N . : 11 12 45 5 3 17 23 21 20 19 18 17 1, . : 54

2016 . , 11 . (2016 - 29 / 54)

1

123 1 ;

0 .

1 6 2 zyx 3 20 4 7 3 5 101 6 31 1211 7 8 8 8 28 9 4 128

10 80 11 3 12 192 13 12 14 28 15 56 16 3 17 85 18 8 19 2 20 130 21 3 22 13 23 1024

2016 . , 11 . (2016 - 30 / 54)

2

, 109. , , 7. , 7, 0. . .

Python DIM N, DIGIT, SUM AS LONG INPUT N SUM = 0 WHILE N > 0 DIGIT = N MOD 10 IF DIGIT < 7 THEN SUM = SUM + 1 END IF N = N \ 10 WEND PRINT DIGIT

N = int(input()) sum = 0 while N > 0: digit = N % 10 if digit < 7: sum = sum + 1 N = N // 10 print(digit)

N, digit, sum N sum := 0 N > 0 digit := mod(N,10) digit < 7 sum := sum + 1 N := div(N,10) digit

var N, digit, sum: longint; begin readln(N); sum := 0; while N > 0 do begin digit := N mod 10; if digit < 7 then sum := sum + 1; N := N div 10; end; writeln(digit) end.

24

2016 . , 11 . (2016 - 31 / 54)

#include int main() { int N, digit, sum; scanf("%d", &N); sum = 0; while (N > 0) { digit = N % 10; if (digit < 7) sum = sum + 1; N = N / 10; } printf("%d",digit); return 0; } . 1. , 456. 2. , . 3. ( ). , . :

1) , ; 2) , , .. .

. , , , , . , .

2016 . , 11 . (2016 - 32 / 54)

( , )

. . 1. 4. 2. , : 835. . - . , , ( ) , 7. 3. . . . : sum := sum + 1; : sum := sum + digit; . . : writeln(digit) : writeln(sum)

2016 . , 11 . (2016 - 33 / 54)

! :

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

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

) ; ) ,

,

3

, 3 . :

) . ; ) .

2

, 2 3 .

1

, 1, 2 3 0 3

2016 . , 11 . (2016 - 34 / 54)

20 . 10 000 10 000 . , , 3. . , : 6; 2; 9; 3; 6 : 4. , . , , .

Python CONST N AS INTEGER = 20 DIM A (1 TO N) AS INTEGER DIM I AS INTEGER, J AS INTEGER, K AS INTEGER FOR I = 1 TO N INPUT A(I) NEXT I ... END

# # # j k a = [] n = 20 for i in range(0, n): a.append(int(input())) ...

N = 20 a[1:N] i, j, k i 1 N a[i] ...

const N = 20; var a: array [1..N] of integer; i, j, k: integer; begin for i := 1 to N do readln(a[i]); ... end.

25

2016 . , 11 . (2016 - 35 / 54)

#include #define N 20 int main() { int a[N]; int i, j, k; for (i = 0; i

2016 . , 11 . (2016 - 37 / 54)

,

2

, 2 . , :

1) (, 1 N);

2) ;

3) ;

4) 3; 5) , ; 6)

; 7) ,

(, , );

8) ; 9) ,

; 10) ; 11) (,

while) ; 12)

1

, . 112, , ( )

0

2

2016 . , 11 . (2016 - 38 / 54)

, , . . , . ( ) . , 10 , 7 ; (10, 7). : (11, 7), (20, 7), (10, 8), (10, 14). , . , 73. , , .. , 73 . , , . , , . , (6, 34), (7, 33), (9, 32) . , . 1. (6, 33), (8, 32) , . ; , , , . 2. (6, 32), (7, 32), (8, 31) , . ; , , , . 3. (7, 31) , . ; , , , . , . .

26

2016 . , 11 . (2016 - 39 / 54)

( , )

1. (6, 33), (8, 32) . (6, 33) : (7, 33), (12, 33), (6, 34), (6, 66). 73 . , 73 , . (8, 32) : (9, 32), (16, 32), (8, 33), (8, 64). 73 . , 73 , . , . 2. (6, 32), (7, 32) (8, 31) . (6, 32) (6, 33), (7, 32) (8, 31). (8, 32). (6, 33) (8, 32) 1. , ( ). 1. , . 3. (7, 31) . : (8, 31), (7, 32), (14, 31) (7, 62). (14, 31) (7, 62) , . (8, 31) (7, 32) 2. , ( ), . 2. , . . . , , , . . ( ) .

2016 . , 11 . (2016 - 40 / 54)

1-

( ,

)

1- ( ,

)

2- ( ,

)

2- ( ,

)

(8+1, 32) = (9, 32)

: 41

(9, 32*2) = (9, 64)

: 73 (8, 32+1) =

(8, 33) : 41

(8, 33*2) = (8, 66)

: 74 (8*2, 32) =

(16, 32) : 48

(16, 32*2) = (16, 64) : 80

(7, 31+1) = (7, 32)

: 39

(7+1, 32) = (8, 32)

: 40

(8, 32*2) = (8, 64)

: 72

(8, 64*2) = (8, 128)

: 136 (8+1, 32) =

(9, 32) : 41

(9, 32*2) = (9, 64)

: 73 (8, 32+1) =

(8, 33) : 41

(8, 33*2) = (8, 66)

: 74 (8*2, 32) =

(16, 32) : 48

(16, 32*2) = (16, 64) : 80

(7+1, 31) = (8, 31)

: 39

(8, 31+1) = (8, 32)

: 40

(8, 32*2) = (8, 64)

: 72

(8, 64*2) = (8, 128)

: 136 (7*2, 31) =

(14, 31) : 45

(14, 31*2) = (14, 62) : 76

(7, 31) : 38

(7, 31*2) = (7, 62)

: 69

(7, 62*2) = (7, 124)

: 131

. , , . , ,

2016 . , 11 . (2016 - 41 / 54)

, . , , .

. 1. , . , . . . : , (8, 64) . , , .

2016 . , 11 . (2016 - 42 / 54)

. ( . ). , , , . , ,

. ,

3

, 3 , .

3. 1 2

2

, 2 3 , .

1. 2

1

, 1, 2 3

0

3

2016 . , 11 . (2016 - 43 / 54)

. 2015. 10 000. 1000. , , . - , 6 . , 1. , : . . . , , 0 . , . . , , . . , . 2 . . , , ( ). , N, .. N k k . , , , N 1 . . , . , , 4 . , , , 3 .

27

2016 . , 11 . (2016 - 44 / 54)

! , . . N . , N > 6. N . : 11 12 45 5 3 17 23 21 20 19 18 17 1, . : 54

2016 . , 11 . (2016 - 45 / 54)

( , )

( , . 4). , , , . k, k = 7, , . , , k 6. , , . , , 6 , . 6 , 6 . 6 . , , . , . , .

2016 . , 11 . (2016 - 46 / 54)

1. . s = 6 | amax = 1001 | N N a | [0:s-1] | s [0:s-1] | s i | s , ; := amax | ; := amax | i 1 s := imin(, a) mod(a,2) = 0 := imin(,a) [mod(i, s)] := [mod(i, s)] := = amax*amax | i s+1 N mod(a,2)=0 := a * [mod(i, s)] < amax := a * [mod(i, s)] := amax*amax; := imin(, ) := imin(, a) mod(a,2) = 0 := imin(,a) [mod(i, s)] := [mod(i, s)] := = amax*amax :=-1 . , . , . ( ), , . N, 4 .

2016 . , 11 . (2016 - 47 / 54)

2. . , const s = 6; { } amax = 1001; { } var N: integer; a: array[1..s] of integer; { s } a_: integer; { } ma: integer; { s } me: integer; { s } mp: integer; { } p: integer; i, j: integer; begin readln(N); { s } for i:=1 to s do readln(a[i]); { , } ma := amax; me := amax; mp :=amax*amax; for i := s + 1 to N do begin readln(a_); if a[1] < ma then ma := a[1]; if (a[1] mod 2 = 0) and (a[1] < me) then me := a[1]; if a_ mod 2 = 0 then p := a_ * ma else if me < amax then p := a_ * me else p := amax* amax; if (p < mp) then mp := p; { } for j := 1 to s - 1 do a[j] := a[j + 1]; a[s] := a_ end; if mp = amax*amax then mp:=-1; writeln(mp) end. ( ) ( ), , , N. . ( ) 3 .

2016 . , 11 . (2016 - 48 / 54)

3. . , const s = 6; { } amax = 1001; { } var N, p, i: integer; a: array[1..10000] of integer; { } ma: integer; { s } me: integer; { s } mp: integer; { } begin readln(N); { } for i:=1 to N do readln(a[i]); ma := amax; me := amax; mp := amax*amax; for i := s + 1 to N do begin if a[i-s] < ma then ma := a[i-s]; if (a[i-s] mod 2 = 0) and (a[i-s] < me) then me := a[i-s]; if a[i] mod 2 = 0 then p := a[i] * ma else if me < amax then p := a[i] * me else p := amax * amax; if (p < mp) then mp := p end; if mp = amax*amax then mp := -1; writeln(mp) end. , . (. 4) . ( ) , . , . 2 .

2016 . , 11 . (2016 - 49 / 54)

4. . , const s = 6; { } var N: integer; a: array[1..10000] of integer; { } mp: integer; { } i, j: integer; begin readln(N); { } for i:=1 to N do readln(a[i]); mp := 1000 * 1000 + 1; for i := 1 to N-s do begin for j := i+s to N do begin if (a[i]*a[j] mod 2 = 0) and (a[i]*a[j] < mp) then mp := a[i]*a[j] end; end; if mp = 1000 * 1000 + 1 then mp := -1; writeln(mp) end.

2016 . , 11 . (2016 - 50 / 54)

. 1. ( ). ,

. , . , , .

2. , , , , . 2.1. .

.

2.2. ,

.

. 2.3. ;

, .

( ) , .

2.4. .

2.12.3. 2.5. ,

, 3 4 . , , .

, , , .

! , .

2016 . , 11 . (2016 - 51 / 54)

. 1. .

, , .

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

3. . 2.12.5 - , . , , 4. (. 4 ). , 3

2

, 2 . , . , . 1 ,

1

, 1 2 0 2

2016 . , 11 . (2016 - 52 / 54)

, , .. , , . (, STL C++) , , 1 ( ; ). :

(, , ..);

;

; , .

(, ). ,

4

, 4 . , . . , N ( 3). , 4 . , :

; , , , 6 < N < 12;

3

2016 . , 11 . (2016 - 53 / 54)

, (, 1 6, 0 5 );

1 ;

Education

Демоверсии ЕГЭ-2016: информатика и ИКТ