2016_инф_11 кл_тренир 1_28.09.2015_235 мин_крит_вар ИН10101-4_68 стр

11
28 2015
10101
: _________________________________ ______
, 27 . 1
23 . 2 4
.
3 55 (235 ).
1–23 ,
.
24–27
.
.
.
, , .
.
!
. 11 . 10101 2
.
1. ():
a) (, ) ¬ (, ¬);
b) ( , ) /\
(, /\ ) & (, & );
c) ( , ) \/
(, \/ ) | (, | );
d) () (, );
e) (, A B). A B
, A B (
, );
f) 1 ( );
0 – ( ).
2. , ,
(),
. , (¬) \/
, \/ /\ ( ,
, = 1, = 0).
3. : (),
( ), ( ),
(), . , ¬ /\ \/ /\ D ,
((¬) /\ ) \/ ( /\ D).
/\ /\ ( /\ ) /\ .
: \/ \/ ( \/ ) \/ .
4.
– ,
«» .
© 20152016 . .
© 20152016 . .

. 11 . 10101 3
. 11 . 10101 4
1
2
1
1–23 ,
. ,
.
1026 10 ?
: ___________________________.
F (¬z)/\x. ,
F
x, y, z.
3
A, B, C, D, E, F ,
.
, .
A B C D E F
A 6 10 3 14
B 6 7
C 10 2 5 3
D 2 4
E 3 5 4
. 1 . 2 . 3
??? ??? ??? F
0 0 0 0
0 0 1 0
0 1 0 1
0 1 1 0
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 0
4
F 14 7 3
A F ( ,
).
: ___________________________.
. 2
.
ID 1.
ID ..
: .
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
ID .. ID ID
7 .. 11 12
11 .. 36 13
12 .. 38 13
13 .. 17 18
16 .. 20 18
17 .. 36 20
18 .. 38 20
20 .. 17 25
25 .. 20 25
36 .. 7 36
37 .. 36 37
38 .. 38 37
51 .. 37 51
… … … … …
: ___________________________.
© 20152016 . .
© 20152016 . .

. 11 . 10101 5
. 11 . 10101 6
5
5- .
, ,
:
A – 11011, – 10000, – 00111.
.
.
.
,
, . (,
« ».) ,
10010, , . (
, .)
, ,
, , (
«x»).
: 01111 10001 11100 11011. .
7
.
A B C
1 4 8
2 =(B1+1)*A1 =(B1+1)*(B1+3) =A1*C1/(2*B1+2)
B1,
A2:2 ?
, ,
, .
: ___________________________.
: ___________________________.
6
, :
1) ,
2) 2.
,
2. , 1 27
. .
, 2122 –
2,
,
2,
2.
3 29.
: ___________________________.
8
c
( -
). .
a = 17
b = 20
a = 3 * a - b
IF a > b THEN
c = 5 * a - b
ELSE
c = 5 * a + b
END IF
a = 17;
b = 20;
a = 3 * a - b;
if (a > b)
c = 5 * a - b;
else
c = 5 * a + b;
a := 17;
b := 20;
a := 3 * a - b;
if a > b then
c := 5 * a - b
else
c := 5 * a + b;
a := 17
b := 20
a := 3 * a - b
a > b
c := 5 * a - b
c := 5 * a + b
: ___________________________.
© 20152016 . .
© 20152016 . .

9
10
. 11 . 10101 7
60
.
. , , .
. .
,
2 23
;
55% ;
, , – 11 , –
4 ?
, , ,
. , ,
.
, , 23 ,
23.
«», «.», «» .
: ___________________________.
4- , , , , ,
.
:
1.
2.
3.
4.
……
, 75.
12
. 11 . 10101 8
void F(int n)
F( n)
{
if (n > 0)
n > 0
{
F(n - 4)
F(n - 4);
n,
printf("%d\n", n); F(div(n, 3))
F(n / 3);
}
}
,
F(9)?
: ___________________________.
TCP/IP ,
, IP- ,
– .
, IP-.
IP- .
IP- .
IP- : 32.130.201.117
: 255.255.240.0
IP-
.
A B C D E F G H
240 201 192 130 117 32 9 0
.
IP-: 192.168.128.0,
A B C D E F G H
128 168 255 8 127 0 17 192
HBAF.
11
: ___________________________.
F.
SUB F(n)
IF n > 0 THEN
F(n - 4)
PRINT n
F(n \ 3)
END IF
END SUB
procedure F(n: integer);
begin
if n > 0 then
begin
F(n - 4);
writeln(n);
F(n div 3)
end
end;
13
: ___________________________.
30 .
,
,
.
, 24 ?
: ___________________________.
© 20152016 . .
© 20152016 . .

. 11 . 10101 9
. 11 . 10101 10
14
, «»
, 4 -
4 .
-:
: , , , .
,
.
4
, :
15
, , , , , , , ,
, , . ,
.
?
, .
1
2
1 ( ) 2 (
).
, ,
,
( 6)?
: ___________________________.
16
17
: ___________________________.
:
4 2016 + 2 2015 – 7?
: ___________________________.
«» «|», «» – «&».
.
,
.
& & 120
& 260
& 310
( ),
:
( | ) &
, .
, ,
, ,
.
: ___________________________.
© 20152016 . .
© 20152016 . .

. 11 . 10101 11
. 11 . 10101 12
18
19
: P = [4, 15] Q = [12, 20].
A,
((x P) /\ (x Q)) (xA)
, 1
.
: ___________________________.
A
1 10. 7; 3; 4; 8; 6; 9; 5; 2; 0; 1
, . . A[1] = 7; A[2] = 3 . .
j
,
.
j = 0
FOR k = 2 TO 10
IF A(k)

. 11 . 10101 13
. 11 . 10101 14
21
,
(
).
DIM A, B, T, M, R AS INTEGER
A = -15: B = 15
M = A: R = F()
FOR T = A TO B
IF F(T) < R THEN
M = T
R = F(T)
END IF
NEXT T
PRINT M+50
FUNCTION F(x)
F = 10*x*x-100*ABS(x)+210
END FUNCTION
#include
int F(int x)
{
return 10*x*x-100*abs(x)+210;
}
void main()
{
int a, b, t, M, R;
a = -15; b = 15;
M = a; R = F(a);
for (t = a; t 1
cnt = cnt + A MOD 10
A = A \ 10
WEND
PRINT cnt
END
© 20152016 . .
var A: longint;
cnt: integer;
begin
readln(A);
cnt := 0;
while A > 1 do
begin
cnt:=cnt + A mod 10;
A := A div 10;
end;
writeln(cnt);
end.

25
. 11 . 10101 15
#include
int main()
{
long int A;
int cnt;
scanf("%ld", &A);
cnt = 0;
while (A > 1)
{
cnt = cnt + A%10;
A = A /10;
}
printf("%d", cnt);
}
© 20152016 . .
A, cnt
A
cnt := 0
A > 1
cnt := cnt + mod(A, 10)
A := div(A, 10)
cnt
.
1. , 111.
2. (
). :
) , ;
) , : .
,
, , ,
. ,
.
40 .
0 10 000 .
,
, 3.
,
, « ».
,
.
, ,
.
N = 40
DIM A(N) AS INTEGER
DIM I, J, MAX AS INTEGER
FOR I = 1 TO N
INPUT A(I)
NEXT I
...
END
const
N = 40;
var
a: array [1..N] of integer;
i, j, max: integer;
begin
for i := 1 to N do
readln(a[i]);
...
end.
26
. 11 . 10101 16
#include
#define N 40
void main() {
N = 40
int a[N];
a[1:N]
int i, j, max;
i, j, max
for (i = 0; i

. 11 . 10101 17
) S,
, .
.
2. 3 S,
,
, .
S .
3. S, :
– ,
,
– ,
.
S .
,
( ).
27
Y –
, 26
.
, ,
( , , Borland
Pascal 7.0), Y ,
1000.
,
, .
.
N.
N ,
1000.
:
5
40
100
130
28
51
:
13000
© 2015−2016 . .

11
28 2015
10102
: _________________________________ ______
, 27 . 1
23 . 2 4
.
3 55 (235 ).
1–23 ,
.
24–27
.
.
.
, , .
.
!
. 11 . 10102 2
.
1. ():
a) (, ) ¬ (, ¬);
b) ( , ) /\
(, /\ ) & (, & );
c) ( , ) \/
(, \/ ) | (, | );
d) () (, );
e) (, A B). A B
, A B (
, );
f) 1 ( );
0 – ( ).
2. , ,
(),
. , (¬) \/
, \/ /\ ( ,
, = 1, = 0).
3. : (),
( ), ( ),
(), . , ¬ /\ \/ /\ D ,
((¬) /\ ) \/ ( /\ D).
/\ /\ ( /\ ) /\ .
: \/ \/ ( \/ ) \/ .
4.
– ,
«» .
© 20152016 . .
© 20152016 . .

. 11 . 10102 3
. 11 . 10102 4
1
1
1–23 ,
. ,
.
1029 10 ?
: ___________________________.
3
A, B, C, D, E, F ,
.
, .
A B C D E F
A 4 7 11 16
B 4 5 6
C 7 9
D 11 6 3
E 5 3 4
F 16 9 4
2
F (¬z)/\x. ,
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 0
4
A F ( ,
).
: ___________________________.
. 2
.
ID 1.
ID ..
: .
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
ID _.. ID_ ID_
9 .. 10 11
10 .. 36 13
11 .. 38 13
13 .. 17 19
16 .. 20 19
17 .. 36 20
19 .. 38 20
20 .. 17 25
25 .. 20 25
36 .. 9 36
37 .. 36 37
38 .. 38 37
50 .. 37 50
… … … … …
: ___________________________.
© 20152016 . .
© 20152016 . .

. 11 . 10102 5
. 11 . 10102 6
5
5- .
, ,
:
A – 11111, – 00011, – 00100.
.
.
.
,
, . (,
« ».) ,
10111, , . (
, .)
, ,
, , (
«x»).
: 00110 00000 11111 11010. .
7
.
A B C
1 2 8
2 =(A1+1)*B1*3 =(A1+1)*(A1+3) =A1*C1/(A12)
A1,
A2:2 ?
, ,
, .
: ___________________________.
: ___________________________.
6
, :
1. ,
2. 2.
,
2. , 1 49
. .
, 2122 –
2,
,
2,
2.
3 29.
: ___________________________.
8
c
(
). .
a = 20
b = 15
b = 3 * b - a
IF a > b THEN
c = 2 * a + b
ELSE
c = 2 * a - b
END IF
a = 20;
b = 15;
b = 3 * b - a;
if (a > b)
c = 2 * a + b;
else
c = 2 * a - b;
a := 20;
b := 15;
b := 3 * b - a;
if a > b then
c := 2 * a + b
else
c := 2 * a - b;
a := 20
b := 15
b := 3 * b - a
a > b
c := 2 * a + b
c := 2 * a - b
: ___________________________.
© 20152016 . .
© 20152016 . .

9
10
11
. 11 . 10102 7
80
.
. , , .
. .
,
2 25
;
35% ;
, , – 15 , –
3 ?
, , ,
. , ,
.
, , 23 ,
23.
«», «.», «» .
: ___________________________.
4- , , , , ,
.
:
1.
2.
3.
4.
……
, 98.
: ___________________________.
F.
SUB F(n)
IF n > 0 THEN
F(n - 4)
F(n \ 3)
PRINT n
END IF
END SUB
procedure F(n: integer);
begin
if n > 0 then
begin
F(n - 4);
F(n div 3);
writeln(n)
end
end;
12
13
. 11 . 10102 8
void F(int n)
F( n)
{
if (n > 0)
n > 0
{
F(n - 4)
F(n - 4);
F(div(n, 3))
F(n / 3);
n,
printf("%d\n", n);
}
}
,
F(10)?
: ___________________________.
TCP/IP ,
, IP- ,
– .
, IP-.
IP- .
IP- .
IP- : 240.144.182.134
: 255.255.248.0
IP-
.
A B C D E F G H
0 134 144 176 182 240 248 6
.
IP-: 192.168.128.0,
A B C D E F G H
128 168 255 8 127 0 17 192
HBAF.
: ___________________________.
43 .
,
, .
,
40 ?
: ___________________________.
© 20152016 . .
© 20152016 . .

. 11 . 10102 9
. 11 . 10102 10
14
, «»
, 4 -
4 .
-:
15
, , , , , , , ,
, , . ,
.
?
: , , , .
,
.
4
, :
: ___________________________.
, .
1
2
1 ( ) 2 (
).
, ,
,
( 6)?
: ___________________________.
16
17
18
:
4 2018 + 2 2017 – 5?
: ___________________________.
«» «|», «» – «&».
.
, .
& 315
& 225
& & 110
( ),
:
( | ) &
, .
, ,
, ,
.
: ___________________________.
: P = [10, 29] Q = [13, 18].
A,
( (x ) (x P) ) \/ (x Q)
, 1
.
: ___________________________.
© 20152016 . .
© 20152016 . .

. 11 . 10102 11
. 11 . 10102 12
19
A
1 10. 7; 3; 4; 8; 6; 9; 5; 2; 0; 1
, . . A[1] = 7; A[2] = 3 . .
j
,
.
j = 0
FOR k = 2 TO 10
IF A(k) > A(1) THEN
A(1) = A(k)
j = j + k
END IF
NEXT k
j := 0;
for k := 2 to 10 do
begin
if A[k] > A[1] then
begin
A[1] := A[k];
j := j + k
end
end;
#include
void main()
{
int x, a, b, c;
scanf("%d", &x);
a = 1; b = 0;
while (x>0) {
c = x%10;
a = a*c;
if (c>b)
b = c;
x = x/10;
}
printf("%d\n%d", a, b);
}
x, a, b, c
x
a := 1; b := 0
x>0
c := mod(x,10)
a := a*c
c>b
b := c
x := div(x,10)
a, , b
j = 0;
for (i = 2; k A[1]) {
A[1] = A[k];
j = j + k;
}
}
k := 0
k 2 10
A[k] > A[1]
A[1] := A[k]
j := j+k
21
: ___________________________.
,
(
).
20
: ___________________________.
.
x, : a b.
x, 48, 6.
DIM X, A, B, C AS INTEGER
INPUT X
A = 1: B = 0
WHILE X > 0
C = X MOD 10
A = A * C
IF C > B THEN B = C
X = X \ 10
WEND
PRINT A
PRINT B
var x, a, b, c: integer;
begin
readln(x);
a := 1; b := 0;
while x>0 do
begin
c := x mod 10;
a := a*c;
if c>b then b := c;
x := x div 10;
end;
writeln(a); write(b);
end.
DIM A, B, T, M, R AS
INTEGER
A = -12: B = 12
M = A: R = F()
FOR T = A TO B
IF F(T)

22
23
. 11 . 10102 13
#include
int F(int x)
{
return 10*x*x-
120*abs(x)+320;
}
void main()
{
int a, b, t, M, R;
a = -12; b = 12;
M = a; R = F(a);
for (t = a; t = 10 do
begin
pr:=pr * (A mod 10);
A := A div 10;
end;
writeln(pr);
end.
A, pr
A
pr := 0
A >= 10
pr := pr * mod (A, 10)
A := div(A, 10)
pr
.
1. , 123.
2. (
). :
) , ;
) , : .
,
, , ,
. ,
.
© 20152016 . .
© 20152016 . .

25
. 11 . 10102 15
30 .
0 10 000 .
,
, 7. ,
,
« ».
,
.
, ,
.
N = 30
DIM A(N) AS INTEGER
DIM I, J, MIN AS INTEGER
FOR I = 1 TO N
INPUT A(I)
NEXT I
...
END
#include
#define N 30
void main() {
int a[N];
int i, j, min;
for (i = 0; i

. 11 . 10102 17
27
–
, 14
.
, ,
( , , Borland
Pascal 7.0), X ,
1000.
,
, .
.
N.
N ,
1000.
:
5
40
1000
7
28
55
:
28000
© 20152016 . .

11
28 2015
10103
: _________________________________ ______
, 27 . 1
23 . 2 4
.
3 55 (235 ).
1–23 ,
.
24–27
.
.
.
, , .
.
!
. 11 . 10103 2
.
1. ():
a) (, ) ¬ (, ¬);
b) ( , ) /\
(, /\ ) & (, & );
c) ( , ) \/
(, \/ ) | (, | );
d) () (, );
e) (, A B). A B
, A B (
, );
f) 1 ( );
0 – ( ).
2. , ,
(),
. , (¬) \/
, \/ /\ ( ,
, = 1, = 0).
3. : (),
( ), ( ),
(), . , ¬ /\ \/ /\ D ,
((¬) /\ ) \/ ( /\ D).
/\ /\ ( /\ ) /\ .
: \/ \/ ( \/ ) \/ .
4.
– ,
«» .
© 20152016 . .
© 20152016 . .

1
2
. 11 . 10103 3
© 20152016 . .
1
1–23 ,
. ,
.
1026 10 ?
: ___________________________.
F (¬z)/\x. ,
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 0
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.
: ___________________________.
3
4
. 11 . 10103 4
A, B, C, D, E, F ,
.
, .
A B C D E F
A 6 10 3 14
B 6 7
C 10 2 5 3
D 2 4
E 3 5 4
F 14 7 3
A F ( ,
).
: ___________________________.
. 2
.
ID 1.
ID ..
: .
1 2
ID _.. ID_ ID_
9 .. 10 11
10 .. 36 13
11 .. 38 13
13 .. 17 19
16 .. 20 19
17 .. 36 20
19 .. 38 20
20 .. 17 25
25 .. 20 25
36 .. 9 36
37 .. 36 37
38 .. 38 37
50 .. 37 50
… … … … …
: ___________________________.
© 20152016 . .

. 11 . 10103 5
. 11 . 10103 6
5
5- .
, ,
:
A – 11011, – 10000, – 00111.
.
.
.
,
, . (,
« ».) ,
10010, , . (
, .)
, ,
, , (
«x»).
: 01111 10001 11100 11011. .
7
.
A B C
1 4 8
2 =(B1+1)*A1 =(B1+1)*(B1+3) =A1*C1/(2*B1+2)
B1,
A2:2 ?
, ,
, .
: ___________________________.
: ___________________________.
6
, :
1. ,
2. 2.
,
2. , 1 49
. .
, 2122 –
2,
,
2,
2.
3 29.
: ___________________________.
8
c
(
). .
a = 20
b = 15
b = 3 * b - a
IF a > b THEN
c = 2 * a + b
ELSE
c = 2 * a - b
END IF
a = 20;
b = 15;
b = 3 * b - a;
if (a > b)
c = 2 * a + b;
else
c = 2 * a - b;
a := 20;
b := 15;
b := 3 * b - a;
if a > b then
c := 2 * a + b
else
c := 2 * a - b;
a := 20
b := 15
b := 3 * b - a
a > b
c := 2 * a + b
c := 2 * a - b
: ___________________________.
© 20152016 . .
© 20152016 . .

9
10
. 11 . 10103 7
60
.
. , , .
. .
,
2 23
;
55% ;
, , – 11 , –
4 ?
, , ,
. , ,
.
, , 23 ,
23.
«», «.», «» .
: ___________________________.
4- , , , , ,
.
:
1.
2.
3.
4.
……
, 98.
12
. 11 . 10103 8
void F(int n)
F( n)
{
if (n > 0)
n > 0
{
F(n - 4)
F(n - 4);
n,
printf("%d\n", n); F(div(n, 3))
F(n / 3);
}
}
,
F(9)?
: ___________________________.
TCP/IP ,
, IP- ,
– .
, IP-.
IP- .
IP- .
IP- : 240.144.182.134
: 255.255.248.0
IP-
.
A B C D E F G H
0 134 144 176 182 240 248 6
.
IP-: 192.168.128.0,
A B C D E F G H
128 168 255 8 127 0 17 192
HBAF.
11
: ___________________________.
F.
SUB F(n)
IF n > 0 THEN
F(n - 4)
PRINT n
F(n \ 3)
END IF
END SUB
procedure F(n: integer);
begin
if n > 0 then
begin
F(n - 4);
writeln(n);
F(n div 3)
end
end;
13
: ___________________________.
30 .
,
,
.
, 24 ?
: ___________________________.
© 20152016 . .
© 20152016 . .

. 11 . 10103 9
. 11 . 10103 10
14
, «»
, 4 -
4 .
-:
: , , , .
,
.
4
, :
15
, , , , , , , ,
, , . ,
.
?
, .
1
2
1 ( ) 2 (
).
, ,
,
( 6)?
: ___________________________.
16
17
: ___________________________.
:
4 2018 + 2 2017 – 5?
: ___________________________.
«» «|», «» – «&».
.
,
.
& & 120
& 260
& 310
( ),
:
( | ) &
, .
, ,
, ,
.
: ___________________________.
© 20152016 . .
© 20152016 . .

. 11 . 10103 11
. 11 . 10103 12
18
19
: P = [10, 29] Q = [13, 18].
A,
( (x ) (x P) ) \/ (x Q)
, 1
.
: ___________________________.
A
1 10. 7; 3; 4; 8; 6; 9; 5; 2; 0; 1
, . . A[1] = 7; A[2] = 3 . .
j
,
.
j = 0
FOR k = 2 TO 10
IF A(k) 0 do
begin
c := x mod 10;
a := a*c;
if c>b then b := c;
x := x div 10;
end;
writeln(a); write(b);
end.
x, a, b, c
x
a := 1; b := 0
x>0
c := mod(x,10)
a := a*c
c>b
b := c
x := div(x,10)
a, , b
: ___________________________.
: ___________________________.
© 20152016 . .
© 20152016 . .

. 11 . 10103 13
. 11 . 10103 14
21
,
(
).
DIM A, B, T, M, R AS INTEGER
A = -15: B = 15
M = A: R = F()
FOR T = A TO B
IF F(T) < R THEN
M = T
R = F(T)
END IF
NEXT T
PRINT M+50
FUNCTION F(x)
F = 10*x*x-100*ABS(x)+210
END FUNCTION
#include
int F(int x)
{
return 10*x*x-100*abs(x)+210;
}
void main()
{
int a, b, t, M, R;
a = -15; b = 15;
M = a; R = F(a);
for (t = a; t = 10
pr = pr * (A MOD 10)
A = A \ 10
WEND
PRINT pr
END
var A,pr: longint;
begin
readln(A);
pr := 0;
while A >= 10 do
begin
pr:=pr * (A mod 10);
A := A div 10;
end;
writeln(pr);
end.
© 20152016 . .
© 20152016 . .

25
. 11 . 10103 15
#include
int main()
{
long int A,pr;
scanf("%ld", &A);
pr = 0;
while (A >= 10)
{
pr = pr * (A%10);
A = A /10;
}
printf("%d", pr);
}
A, pr
A
pr := 0
A >= 10
pr := pr * mod (A, 10)
A := div(A, 10)
pr
.
1. , 123.
2. (
). :
) , ;
) , : .
,
, , ,
. ,
.
40 .
0 10 000 .
,
, 3.
,
, « ».
,
.
, ,
.
N = 40
DIM A(N) AS INTEGER
DIM I, J, MAX AS INTEGER
FOR I = 1 TO N
INPUT A(I)
NEXT I
...
END
const
N = 40;
var
a: array [1..N] of integer;
i, j, max: integer;
begin
for i := 1 to N do
readln(a[i]);
...
end.
26
. 11 . 10103 16
#include
#define N 40
void main() {
N = 40
int a[N];
a[1:N]
int i, j, max;
i, j, max
for (i = 0; i

. 11 . 10103 17
) S,
, .
.
2. 3 S,
,
, .
S .
3. S, :
– ,
,
– ,
.
S .
,
( ).
27
Y –
, 26
.
, ,
( , , Borland
Pascal 7.0), Y ,
1000.
,
, .
.
N.
N ,
1000.
:
5
40
100
130
28
51
:
13000
© 2015−2016 . .

11
28 2015
10104
: _________________________________ ______
, 27 . 1
23 . 2 4
.
3 55 (235 ).
1–23 ,
.
24–27
.
.
.
, , .
.
!
. 11 . 10104 2
.
1. ():
a) (, ) ¬ (, ¬);
b) ( , ) /\
(, /\ ) & (, & );
c) ( , ) \/
(, \/ ) | (, | );
d) () (, );
e) (, A B). A B
, A B (
, );
f) 1 ( );
0 – ( ).
2. , ,
(),
. , (¬) \/
, \/ /\ ( ,
, = 1, = 0).
3. : (),
( ), ( ),
(), . , ¬ /\ \/ /\ D ,
((¬) /\ ) \/ ( /\ D).
/\ /\ ( /\ ) /\ .
: \/ \/ ( \/ ) \/ .
4.
– ,
«» .
© 20152016 . .
© 20152016 . .

. 11 . 10104 3
. 11 . 10104 4
1
2
1
1–23 ,
. ,
.
1029 10 ?
: ___________________________.
F (¬z)/\x. ,
F
x, y, z.
3
A, B, C, D, E, F ,
.
, .
A B C D E F
A 4 7 11 16
B 4 5 6
C 7 9
D 11 6 3
E 5 3 4
. 1 . 2 . 3
??? ??? ??? F
0 0 0 0
0 0 1 0
0 1 0 1
0 1 1 0
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 0
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.
4
F 16 9 4
A F ( ,
).
: ___________________________.
. 2
.
ID 1.
ID ..
: .
1 2
ID .. ID ID
7 .. 11 12
11 .. 36 13
12 .. 38 13
13 .. 17 18
16 .. 20 18
17 .. 36 20
18 .. 38 20
20 .. 17 25
25 .. 20 25
36 .. 7 36
37 .. 36 37
38 .. 38 37
51 .. 37 51
… … … … …
: ___________________________.
: ___________________________.
© 20152016 . .
© 20152016 . .

. 11 . 10104 5
. 11 . 10104 6
5
5- .
, ,
:
A – 11111, – 00011, – 00100.
.
.
.
,
, . (,
« ».) ,
10111, , . (
, .)
, ,
, , (
«x»).
: 00110 00000 11111 11010. .
7
.
A B C
1 2 8
2 =(A1+1)*B1*3 =(A1+1)*(A1+3) =A1*C1/(A12)
A1,
A2:2 ?
, ,
, .
: ___________________________.
6
, :
1) ,
2) 2.
,
2. , 1 27
. .
, 2122 –
2,
,
2,
2.
3 29.
: ___________________________.
8
: ___________________________.
c
(
). .
a = 17
b = 20
a = 3 * a - b
IF a > b THEN
c = 5 * a - b
ELSE
c = 5 * a + b
END IF
a = 17;
b = 20;
a = 3 * a - b;
if (a > b)
c = 5 * a - b;
else
c = 5 * a + b;
a := 17;
b := 20;
a := 3 * a - b;
if a > b then
c := 5 * a - b
else
c := 5 * a + b;
a := 17
b := 20
a := 3 * a - b
a > b
c := 5 * a - b
c := 5 * a + b
: ___________________________.
© 20152016 . .
© 20152016 . .

9
10
11
. 11 . 10104 7
80
.
. , , .
. .
,
2 25
;
35% ;
, , – 15 , –
3 ?
, , ,
. , ,
.
, , 23 ,
23.
«», «.», «» .
: ___________________________.
4- , , , , ,
.
:
1.
2.
3.
4.
……
, 75.
: ___________________________.
F.
SUB F(n)
IF n > 0 THEN
F(n - 4)
F(n \ 3)
PRINT n
END IF
END SUB
procedure F(n: integer);
begin
if n > 0 then
begin
F(n - 4);
F(n div 3);
writeln(n)
end
end;
12
13
. 11 . 10104 8
void F(int n)
F( n)
{
if (n > 0)
n > 0
{
F(n - 4)
F(n - 4);
F(div(n, 3))
F(n / 3);
n,
printf("%d\n", n);
}
}
,
F(10)?
: ___________________________.
TCP/IP ,
, IP- ,
– .
, IP-.
IP- .
IP- .
IP- : 32.130.201.117
: 255.255.240.0
IP-
.
A B C D E F G H
240 201 192 130 117 32 9 0
.
IP-: 192.168.128.0,
A B C D E F G H
128 168 255 8 127 0 17 192
HBAF.
: ___________________________.
43 .
,
, .
,
40 ?
: ___________________________.
© 20152016 . .
© 20152016 . .

. 11 . 10104 9
. 11 . 10104 10
14
, «»
, 4 -
4 .
-:
: , , , .
,
.
4
, :
15
, , , , , , , ,
, , . ,
.
?
, .
1
2
1 ( ) 2 (
).
, ,
,
( 6)?
: ___________________________.
16
17
: ___________________________.
:
4 2016 + 2 2015 – 7?
: ___________________________.
«» «|», «» – «&».
.
, .
& 315
& 225
& & 110
( ),
:
( | ) &
, .
, ,
, ,
.
: ___________________________.
© 20152016 . .
© 20152016 . .

. 11 . 10104 11
. 11 . 10104 12
18
19
: P = [4, 15] Q = [12, 20].
A,
((x P) /\ (x Q)) (xA)
, 1
.
: ___________________________.
A
1 10. 7; 3; 4; 8; 6; 9; 5; 2; 0; 1
, . . A[1] = 7; A[2] = 3 . .
j
,
.
j = 0
FOR k = 2 TO 10
IF A(k) > A(1) THEN
A(1) = A(k)
j = j + k
END IF
NEXT k
j = 0;
for (i = 2; k A[1]) {
A[1] = A[k];
j = j + k;
}
}
j := 0;
for k := 2 to 10 do
begin
if A[k] > A[1] then
begin
A[1] := A[k];
j := j + k
end
end;
k := 0
k 2 10
A[k] > A[1]
A[1] := A[k]
j := j+k
20
.
x, : a b.
x, 45, 5.
DIM X, A, B, C AS INTEGER
INPUT X
A = 1: B = 10
WHILE X > 0
C = X MOD 10
A = A * C
IF C < B THEN B = C
X = X \ 10
WEND
PRINT A
PRINT B
#include
void main()
{
int x, a, b, c;
scanf("%d", &x);
a = 1; b = 10;
while (x>0) {
c = x%10;
a = a*c;
if (c0 do
begin
c := x mod 10;
a := a*c;
if c0
c := mod(x,10)
a := a*c
c

. 11 . 10104 13
. 11 . 10104 14
21
,
(
).
DIM A, B, T, M, R AS INTEGER
A = -12: B = 12
M = A: R = F()
FOR T = A TO B
IF F(T)

25
. 11 . 10104 15
#include
int main()
{
long int A;
int cnt;
scanf("%ld", &A);
cnt = 0;
while (A > 1)
{
cnt = cnt + A%10;
A = A /10;
}
printf("%d", cnt);
}
END
© 20152016 . .
A, cnt
A
cnt := 0
A > 1
cnt := cnt + mod(A, 10)
A := div(A, 10)
cnt
.
1. , 111.
2. (
). :
) , ;
) , : .
,
, , ,
. ,
.
30 .
0 10 000 .
,
, 7. ,
,
« ».
,
.
, ,
.
N = 30
DIM A(N) AS INTEGER
DIM I, J, MIN AS INTEGER
FOR I = 1 TO N
INPUT A(I)
NEXT I
...
const
N = 30;
var
a: array [1..N] of integer;
i, j, min: integer;
begin
for i := 1 to N do
readln(a[i]);
...
end.
26
. 11 . 10104 16
#include
#define N 30
void main() {
int a[N];
int i, j, min;
for (i = 0; i

. 11 . 10104 17
1. ) S,
. , S,
S.
) S,
, .
.
2. 3 S,
,
, .
S .
3. S, :
– ,
,
– ,
.
S .
,
( ).
27
–
, 14
.
, ,
( , , Borland
Pascal 7.0), X ,
1000.
,
, .
.
N.
N ,
1000.
:
5
40
1000
7
28
55
:
28000
© 20152016 . .

24
. 11 . 10101 1
,
A, 10 9 ,
.
. (
.)
DIM A AS LONG
INPUT A
cnt = 0
WHILE A > 1
cnt = cnt + A MOD 10
A = A \ 10
WEND
PRINT cnt
END
#include
int main()
{
long int A;
int cnt;
scanf("%ld", &A);
cnt = 0;
while (A > 1)
{
cnt = cnt + A%10;
A = A /10;
}
printf("%d", cnt);
}
var A: longint;
cnt: integer;
begin
readln(A);
cnt := 0;
while A > 1 do
begin
cnt:=cnt + A mod 10;
A := A div 10;
end;
writeln(cnt);
end.
A, cnt
A
cnt := 0
A > 1
cnt := cnt + mod(A, 10)
A := div(A, 10)
cnt
.
1. , 111.
2. (
). :
) , ;
) , : .
,
, , ,
. ,
.
. 11 . 10101 2
( , )
.
.
1. 2.
2. . .
, 1.
:
while A > 1 do
:
while (A >= 1) do
while (A > 0) do
while (A >= 0) do .
3. . ( cnt).
.
:
nt := cnt + A mod 10;
:
nt := cnt + 1;
! :
, ,
.
( ,
).
1. ,
.
2. ,
.
3.
, .
. 2 3 , :
) ;
) ,
.
A, 10 9 ,
.
( )
, .
3
© 2015–2016 . .
© 2015–2016 . .

25
. 11 . 10101 3
.
2
1. (
, . 1 ,
. 1 ).
.
2. . 1,
, ,
.
3. (
1, ),
,
, 1
. 1,
( . 1 0
; ,
)
3
40 .
0 10 000 .
,
, 3.
,
, « ».
,
.
, ,
.
N = 40
DIM A(N) AS INTEGER
DIM I, J, MAX AS INTEGER
FOR I = 1 TO N
INPUT A(I)
NEXT I
...
END
© 2015–2016 . .
const
N = 40;
var
a: array [1..N] of integer;
i, j, max: integer;
begin
for i := 1 to N do
readln(a[i]);
...
end.
. 11 . 10101 4
#include
#define N 40
void main() {
N = 40
int a[N];
a[1:N]
int i, j, max;
i, j, max
for (i = 0; i=10) and (a[i]max) then
max := a[i];
if max > 9 then writeln(max) else writeln( );
max := 9
i 1 N
a[i]>=10 a[i]max
max := a[i]
max > 9
max
" "
© 2015–2016 . .

. 11 . 10101 5
MAX = 9
FOR I = 1 TO N
IF A(I)>=10 AND A(I)MAX THEN
MAX = A(I)
END IF
NEXT I
IF MAX > 9 THEN
PRINT MAX
ELSE
PRINT " "
END IF
max = 9;
for (i = 0; i9 && a[i]max)
max = a[i];
if (max>9)
printf("%d", max);
else
printf(" ");
MAX , 9.
3. 0
9 100,
MAX.
MAX, MAX
. .
MAX.
9, , « ».
, .
2
,
. ,
,
.
,
,
.
, ,
,
.
26
. 11 . 10101 6
1
:
1)
MAX (,
, 10);
2)
(, 10 «
» «»;
,
10 98);
3) 3;
4) 3 ,
;
5) «»
«»;
6)
,
;
7) ,
;
8) ;
9) (,
while) ;
10) .
, . 1–10, , 0
.
2
, , .
. , .
. , 15 ,
16, 18 30 . ,
, .
,
33. , ,
, 33 .
S , 1 S 32.
, ,
. –
, ,
.
© 2015–2016 . .
© 2015–2016 . .

. 11 . 10101 7
. .
1. ) S,
. , S,
S.
) S,
, .
.
2. 3 S,
,
, .
S .
3. S, :
– ,
,
– ,
.
S .
,
( ).
. 11 . 10101 8
. ( ) .
(
).
12
1- 1- 2-
( ( (
) ) )
12 + 1 = 13 13 + 3 = 16
12 + 3 = 15 15 + 1 = 16
12 * 2 = 24 24 * 2 = 48
2-
(
)
16 + 1 = 17 17 * 2 = 34
16 + 3 = 19 19 * 2 = 38
16 * 2 = 32 32 * 2 = 64
16 + 1 = 17 17 * 2 = 34
16 + 3 = 19 19 * 2 = 38
16 * 2 = 32 32 * 2 = 64
( , )
1. ) , S = 17, … 32.
. S
, 33 .
) ( ),
S = 16 .
17, 19 32 .
.
2. S: 8, 13, 15. , 1,
. 16 :
, – ,
– . . 1.
, ( ), ,
( ) .
3. S = 12 S = 14 (
).
S = 12, 13, 15,
24 . 24 ,
. , 13 15 ,
. 2. , ( ),
.
. 1. , ( S = 12).
>> ,
© 2015–2016 . .
© 2015–2016 . .

. 11 . 10101 9
S = 14, 15, 17, 28
. 17 28 ,
. , 15 , . 2.
, ( ),
.
. ( ) .
(
).
14
1- 1- 2-
( ( (
) ) )
14 + 3 = 17 17 * 2 = 34
14 + 1 = 15 15 + 1 = 16
14 * 2 = 28 28 * 2 = 56
2-
(
)
16 + 1 = 17 17 * 2 = 34
16 + 3 = 19 19 * 2 = 38
16 * 2 = 32 32 * 2 = 64
. 2. , ( S = 14).
>> ,
. 11 . 10101 10
.
.
( . ).
,
, ,
,
.
,
: ) ). )
, ,
, ,
. )
, ,
, ,
, ,
, .
, :
) ,
; ) ,
, ,
,
.
, ,
.
,
, ,
– ,
, , ,
, .
,
, , ,
.
, ,
, , , –
, , .
,
,
.
.
,
(. ).
3
© 2015–2016 . .
© 2015–2016 . .

27
. 11 . 10101 11
, 3 , 2
.
1. .
2. .
3. ,
,
S
, 3 2 , 1
.
1. .
2.
S,
.
3. ,
S,
S .
4. S,
S
, 3, 2 0
1
3
Y –
, 26
.
, ,
( , , Borland
Pascal 7.0), Y ,
1000.
,
, .
.
N.
N ,
1000.
:
5
40
100
130
28
51
© 2015–2016 . .
. 11 . 10101 12
:
13000
( , )
26, :
26 ( )
26,
13, – 2.
, Y, .
,
.
:
13 – , 13, 2;
M2 – , 2, 13;
M26 – , 26;
AX – ,
26 ( 26
, MAX = M26).
, Y
26*MAX 13*2.
,
.
, ,
, ,
. .
, .
© 2015–2016 . .

. 11 . 10101 13
:
var M13,M2,M26,MAX,dat,res,i,N: longint;
begin
M13 := 0;
M2 := 0;
M26 := 0;
MAX := 0;
readln(N);
for i := 1 to N do
begin
readln(dat);
if ((dat mod 13) = 0) and ((dat mod 2) > 0) and (dat > M13) then
M13 := dat;
if ((dat mod 2) = 0) and ((dat mod 13) > 0) and (dat > M2) then
M2 := dat;
if (dat mod 26 = 0) and (dat > M26) then
begin
if M26 > MAX then MAX := M26;
M26 := dat
end
else
if dat > MAX then
MAX := dat;
end;
if (M13*M2 < M26*MAX) then
res := M26*MAX
else
res := M13*M2;
writeln(res);
end.
. 11 . 10101 14
:
M26 = 0
M13 = 0
M2 = 0
MAX = 0
INPUT N
FOR I = 1 TO N
INPUT DAT
IF DAT MOD 13 = 0 AND DAT > M13 THEN
M13 = DAT
ELSE
IF DAT MOD 2 = 0 AND DAT > M2 THEN
M2 = DAT
END IF
END IF
IF DAT MOD 26 = 0 AND DAT > M26 THEN
IF M26 > MAX THEN
MAX = M26
END IF
M26 = DAT
ELSE
IF DAT > MAX THEN
MAX = DAT
END IF
END IF
NEXT I
IF M2 * M13 < M26 * MAX THEN
RES = M26 * MAX
ELSE
RES = M2 * M13
END IF
PRINT RES
END
© 2015–2016 . .
© 2015–2016 . .

. 11 . 10101 15
4
, , ,
.
3 , ,
- ,
,
( ,
).
2 ,
( )
-
.
1 , ,
,
.
.
4
.
,
.
:
;
;
;
,
(
, ).
, 4 .
3
.
.
(«»)
– .
, ,
(,
( priority_queue,
vector, set map ++)).
,
© 2015–2016 . .
. 11 . 10101 16
«» . ,
16- (integer BPascal Qbasic)
(
16 ).
, ,
.
1. .
2. ,
.
3. ,
(
).
4.
a[i]*a[i].
5. .
6. «

24
. 11 . 10102 1
,
A, 10 9 ,
.
. (
.)
DIM A AS LONG
DIM pr AS LONG
INPUT A
pr = 0
WHILE A >= 10
pr = pr * (A MOD 10)
A = A \ 10
WEND
PRINT pr
END
#include
int main()
{
long int A,pr;
scanf("%ld", &A);
pr = 0;
while (A >= 10)
{
pr = pr * (A%10);
A = A /10;
}
printf("%d", pr);
}
var A,pr: longint;
begin
readln(A);
pr := 0;
while A >= 10 do
begin
pr:=pr * (A mod 10);
A := A div 10;
end;
writeln(pr);
end.
A, pr
A
pr := 0
A >= 10
pr := pr * mod (A, 10)
A := div(A, 10)
pr
.
1. , 123.
2. (
). :
) , ;
) , : .
,
, , ,
. ,
.
. 11 . 10102 2
( , )
.
.
1. 0.
2. . pr.
:
pr := 0;
:
pr := 1;
3. . .
:
while A >= 10 do
:
while (A >= 1) do
while (A > 0) do
while (A > 1) do while (A >= 0) do
.
! :
, ,
.
( ,
).
1. ,
.
2. ,
.
3. ,
.
. 2 3 , :
) ;
) ,
.
. 3
A, 10 9 ,
.
( )
, .
© 2015–2016 . .
© 2015–2016 . .

25
. 11 . 10102 3
.
2
1. (
, . 1 ,
. 1 ).
.
2. . 1,
, ,
.
3. (
1, ),
, .
, 1
. 1,
.
( . 1 0
; ,
).
3
30 .
0 10 000 .
,
, 7. ,
,
« ».
,
.
, ,
.
N = 30
DIM A(N) AS INTEGER
DIM I, J, MIN AS INTEGER
FOR I = 1 TO N
INPUT A(I)
NEXT I
...
END
© 2015–2016 . .
const
N = 30;
var
a: array [1..N] of integer;
i, j, min: integer;
begin
for i := 1 to N do
readln(a[i]);
...
end.
. 11 . 10102 4
#include
#define N 30
void main() {
int a[N];
int i, j, min;
for (i = 0; i=100) and (a[i]

. 11 . 10102 5
min := 1000
i 1 N
a[i]>=100 a[i]

. 11 . 10102 7
. 11 . 10102 8
26
, , .
. , .
. , 15 ,
16, 17 45 . ,
, .
,
46. , ,
, 46 .
S , 1 S 45.
, ,
. –
, ,
.
. .
1. ) S,
. , S,
S.
) S,
, .
.
2. 3 S,
,
, .
S .
3. S, :
– ,
,
– ,
.
S .
,
( ).
( , )
1. ) , S = 16, … 45.
. S
, 45 .
) ( ),
S = 15 .
16, 17 45 .
.
2. S: 5, 13, 14. , ,
. 15 :
, –
, – . . 1.
, ( ), ,
( ) .
3. S: 12. 13, 14
36 . 36 ,
. , 13 14 ,
. 2. , ( ),
.
. ( ) .
(
).
12
1- 1- 2-
( ( (
) ) )
12 + 1 = 13 13 + 2 = 15
12 + 2 = 14 14 + 1 = 15
12 * 3 = 36 36 * 3 = 108
2-
(
)
15 + 1 = 16 16 * 3 = 48
15 + 2 = 17 17 * 3 = 51
15 * 3 = 45 45 * 3 = 135
15 + 1 = 16 16 * 3 = 48
15 + 2 = 17 17 * 3 = 51
15 * 3 = 45 45 * 3 = 135
© 2015–2016 . .
© 2015–2016 . .

. 11 . 10102 9
12
1-
+1
*3
+2
13
14
36
1-
+2
+1
*3
. 1. , . >>
,
.
.
( . ).
,
, ,
,
.
,
: ) ). )
, ,
, ,
. ) ,
,
, , ,
,
, .
, :
) ,
; ) ,
© 2015–2016 . .
15
15
108>>
2-
+1
+1
+2
*3
+2
*3
16
17
45
16
17
45
2-
*3
*3
*3
*3
*3
*3
48>>
51>>
135>
48>>
51>>
135>
. 11 . 10102 10
, ,
,
.
, ,
.
,
, ,
– ,
, , ,
, .
, ,
, ,
. ,
, ,
, , – ,
, .
,
, .
. 3
.
,
(. ).
, 3 , 2
.
1. .
2. .
3. ,
S.
, 3 2 , 1
.
1. .
2.
S,
.
3. ,
S.
4. S.
, 3, 2 0
1 .
3
© 2015–2016 . .

27
. 11 . 10102 11
–
, 14
.
, ,
( , , Borland
Pascal 7.0), X ,
1000.
,
, .
.
N.
N ,
1000.
:
5
40
1000
7
28
55
:
28000
( , )
14, :
14 ( )
14,
7, – 2.
, X, .
,
.
:
7 – , 7, 2;
M2 – , 2, 7;
M14 – , 14;
AX – ,
14 ( 14
, MAX = M14).
, X
14*MAX 7*2.
© 2015–2016 . .
. 11 . 10102 12
,
.
, ,
, ,
. .
, .
:
var M7,M2,M14,MAX,dat,res,i,N: longint;
begin
M7 := 0;
M2 := 0;
M14 := 0;
MAX := 0;
readln(N);
for i := 1 to N do
begin
readln(dat);
if ((dat mod 7) = 0) and ((dat mod 2) > 0) and (dat > M7) then
M7 := dat;
if ((dat mod 2) = 0) and ((dat mod 7) > 0) and (dat > M2) then
M2 := dat;
if (dat mod 14 = 0) and (dat > M14) then
begin
if M14 > MAX then MAX := M14;
M14 := dat
end
else
if dat > MAX then
MAX := dat;
end;
if (M7*M2 < M14*MAX) then
res := M14*MAX
else
res := M7*M2;
writeln(res);
end.
© 2015–2016 . .

. 11 . 10102 13
. 11 . 10102 14
:
M14 = 0
M7 = 0
M2 = 0
MAX = 0
INPUT N
FOR I = 1 TO N
INPUT DAT
IF DAT MOD 7 = 0 AND DAT > M7 THEN
M7 = DAT
ELSE
IF DAT MOD 2 = 0 AND DAT > M2 THEN
M2 = DAT
END IF
END IF
IF DAT MOD 14 = 0 AND DAT > M14 THEN
IF M14 > MAX THEN
MAX = M14
END IF
M14 = DAT
ELSE
IF DAT > MAX THEN
MAX = DAT
END IF
END IF
NEXT I
IF M2 * M7 < M14 * MAX THEN
RES = M14 * MAX
ELSE
RES = M2 * M7
END IF
PRINT RES
END
© 2015–2016 .
4
, , ,
.
3 , ,
- ,
,
( ,
).
2 ,
( )
-
.
1 , ,
,
.
.
.
,
.
:
;
;
;
,
(
, ).
, 4 .
.
.
(«»)
– .
, ,
(,
( priority_queue,
vector, set map ++)).
,
© 2015–2016 . .
4
3

. 11 . 10102 15
«» . ,
16- (integer BPascal Qbasic)
(
16 ).
, ,
.
1. .
2. ,
.
3. ,
(
).
4.
a[i]*a[i].
5. .
6. «

24
. 11 . 10103 1
,
A, 10 9 ,
.
. (
.)
DIM A AS LONG
DIM pr AS LONG
INPUT A
pr = 0
WHILE A >= 10
pr = pr * (A MOD 10)
A = A \ 10
WEND
PRINT pr
END
#include
int main()
{
long int A,pr;
scanf("%ld", &A);
pr = 0;
while (A >= 10)
{
pr = pr * (A%10);
A = A /10;
}
printf("%d", pr);
}
© 2015–2016 . .
var A,pr: longint;
begin
readln(A);
pr := 0;
while A >= 10 do
begin
pr:=pr * (A mod 10);
A := A div 10;
end;
writeln(pr);
end.
A, pr
A
pr := 0
A >= 10
pr := pr * mod (A, 10)
A := div(A, 10)
pr
.
1. , 123.
2. (
). :
) , ;
) , : .
,
, , ,
. ,
.
. 11 . 10103 2
( , )
.
.
1. 0.
2. . pr.
:
pr := 0;
:
pr := 1;
3. . .
:
while A >= 10 do
:
while (A >= 1) do
while (A > 0) do
while (A > 1) do while (A >= 0) do
.
! :
, ,
.
( ,
).
1. ,
.
2. ,
.
3. ,
.
. 2 3 , :
) ;
) ,
.
. 3
A, 10 9 ,
.
( )
, .
. 2
© 2015–2016 . .

25
. 11 . 10103 3
1. (
, . 1 ,
. 1 ).
.
2. . 1,
, ,
.
3. (
1, ),
, .
, 1
. 1,
.
( . 1 0
; ,
).
3
40 .
0 10 000 .
,
, 3.
,
, « ».
,
.
, ,
.
N = 40
DIM A(N) AS INTEGER
DIM I, J, MAX AS INTEGER
FOR I = 1 TO N
INPUT A(I)
NEXT I
...
END
© 2015–2016 . .
const
N = 40;
var
a: array [1..N] of integer;
i, j, max: integer;
begin
for i := 1 to N do
readln(a[i]);
...
end.
. 11 . 10103 4
#include
#define N 40
void main() {
N = 40
int a[N];
a[1:N]
int i, j, max;
i, j, max
for (i = 0; i=10) and (a[i]max) then
max := a[i];
if max > 9 then writeln(max) else writeln( );
max := 9
i 1 N
a[i]>=10 a[i]max
max := a[i]
max > 9
max
" "
© 2015–2016 . .

. 11 . 10103 5
MAX = 9
FOR I = 1 TO N
IF A(I)>=10 AND A(I)MAX THEN
MAX = A(I)
END IF
NEXT I
IF MAX > 9 THEN
PRINT MAX
ELSE
PRINT " "
END IF
max = 9;
for (i = 0; i9 && a[i]max)
max = a[i];
if (max>9)
printf("%d", max);
else
printf(" ");
MAX , 9.
3. 0
9 100,
MAX.
MAX, MAX
. .
MAX.
9, , « ».
, .
2
,
. ,
,
.
,
,
.
, ,
,
.
© 2015–2016 . .
26
. 11 . 10103 6
1
:
1)
MAX (,
, 10);
2)
(, 10 «
» «»;
,
10 98);
3) 3;
4) 3 ,
;
5) «»
«»;
6)
,
;
7) ,
;
8) ;
9) (,
while) ;
10) .
, . 1–10, , 0
.
2
, , .
. , .
. , 15 ,
16, 17 45 . ,
, .
,
46. , ,
, 46 .
S , 1 S 45.
, ,
. –
, ,
.
. .
© 2015–2016 . .

. 11 . 10103 7
1. ) S,
. , S,
S.
) S,
, .
.
2. 3 S,
,
, .
S .
3. S, :
– ,
,
– ,
.
S .
,
( ).
( , )
1. ) , S = 16, … 45.
. S
, 45 .
) ( ),
S = 15 .
16, 17 45 .
.
2. S: 5, 13, 14. , ,
. 15 :
, –
, – . . 1.
, ( ), ,
( ) .
3. S: 12. 13, 14
36 . 36 ,
. , 13 14 ,
. 2. , ( ),
.
. ( ) .
(
).
© 2015–2016 . .
. 11 . 10103 8
12
12
1-
+1
*3
+2
1- 1- 2-
( ( (
) ) )
12 + 1 = 13 13 + 2 = 15
12 + 2 = 14 14 + 1 = 15
12 * 3 = 36 36 * 3 = 108
13
14
36
1-
+2
+1
*3
© 2015–2016 . .
15
15
108>>
2-
+1
+1
2-
(
)
15 + 1 = 16 16 * 3 = 48
15 + 2 = 17 17 * 3 = 51
15 * 3 = 45 45 * 3 = 135
15 + 1 = 16 16 * 3 = 48
15 + 2 = 17 17 * 3 = 51
15 * 3 = 45 45 * 3 = 135
. 1. , . >>
,
+2
*3
+2
*3
16
17
45
16
17
45
2-
*3
*3
*3
*3
*3
*3
48>>
51>>
135>
48>>
51>>
135>

. 11 . 10103 9
. 11 . 10103 10
.
.
( . ).
,
, ,
,
.
,
: ) ). )
, ,
, ,
. ) ,
,
, , ,
,
, .
, :
) ,
; ) ,
, ,
,
.
, ,
.
,
, ,
– ,
, , ,
, .
, ,
, ,
. ,
, ,
, , – ,
, .
,
, .
.
.
,
(. ).
3
27
, 3 , 2
.
1. .
2. .
3. ,
S.
, 3 2 , 1
.
1. .
2.
S,
.
3. ,
S.
4. S.
, 3, 2 0
1 .
3
Y –
, 26
.
, ,
( , , Borland
Pascal 7.0), Y ,
1000.
,
, .
.
N.
N ,
1000.
:
5
40
100
130
28
51
:
13000
© 2015–2016 . .
© 2015–2016 . .

. 11 . 10103 11
( , )
26, :
26 ( )
26,
13, – 2.
, Y, .
,
.
:
13 – , 13, 2;
M2 – , 2, 13;
M26 – , 26;
AX – ,
26 ( 26
, MAX = M26).
, Y
26*MAX 13*2.
,
.
, ,
, ,
. .
, .
. 11 . 10103 12
:
var M13,M2,M26,MAX,dat,res,i,N: longint;
begin
M13 := 0;
M2 := 0;
M26 := 0;
MAX := 0;
readln(N);
for i := 1 to N do
begin
readln(dat);
if ((dat mod 13) = 0) and ((dat mod 2) > 0) and (dat > M13) then
M13 := dat;
if ((dat mod 2) = 0) and ((dat mod 13) > 0) and (dat > M2) then
M2 := dat;
if (dat mod 26 = 0) and (dat > M26) then
begin
if M26 > MAX then MAX := M26;
M26 := dat
end
else
if dat > MAX then
MAX := dat;
end;
if (M13*M2 < M26*MAX) then
res := M26*MAX
else
res := M13*M2;
writeln(res);
end.
© 2015–2016 . .
© 2015–2016 . .

. 11 . 10103 13
:
M26 = 0
M13 = 0
M2 = 0
MAX = 0
INPUT N
FOR I = 1 TO N
INPUT DAT
IF DAT MOD 13 = 0 AND DAT > M13 THEN
M13 = DAT
ELSE
IF DAT MOD 2 = 0 AND DAT > M2 THEN
M2 = DAT
END IF
END IF
IF DAT MOD 26 = 0 AND DAT > M26 THEN
IF M26 > MAX THEN
MAX = M26
END IF
M26 = DAT
ELSE
IF DAT > MAX THEN
MAX = DAT
END IF
END IF
NEXT I
IF M2 * M13 < M26 * MAX THEN
RES = M26 * MAX
ELSE
RES = M2 * M13
END IF
PRINT RES
END
4
, , ,
.
3 , ,
- ,
,
( ,
).
2 ,
( )
-
.
1 , ,
© 2015–2016 . .
. 11 . 10103 14
,
.
.
.
,
.
:
;
;
;
,
(
, ).
, 4 .
.
.
(«»)
– .
, ,
(,
( priority_queue,
vector, set map ++)).
,
«» . ,
16- (integer BPascal Qbasic)
(
16 ).
, ,
.
1. .
2. ,
.
3. ,
(
).
4.
a[i]*a[i].
5. .
6. «

. 11 . 10103 15
, 3 4 . 2
, ,
,
3 .
«» .
. ,
( n –
),
, , :
max := 0;
for i := 1 to n - 1 do
for j := i + 1 to n do
if ((a[i]*a[j]) mod 26 = 0) and
((a[i]*a[j]) > max) then
max := a[i]*a[j];
, 2, 3 4 . 1
.
1. ,
.
2.
, , , –
, 2,
, 13.
.
, 1, 2, 3 0
4 .
4
© 2015–2016 . .

24
. 11 . 10104 1
,
A, 10 9 ,
.
. (
.)
DIM A AS LONG
INPUT A
cnt = 0
WHILE A > 1
cnt = cnt + A MOD 10
A = A \ 10
WEND
PRINT cnt
END
#include
int main()
{
long int A;
int cnt;
scanf("%ld", &A);
cnt = 0;
while (A > 1)
{
cnt = cnt + A%10;
A = A /10;
}
printf("%d", cnt);
}
var A: longint;
cnt: integer;
begin
readln(A);
cnt := 0;
while A > 1 do
begin
cnt:=cnt + A mod 10;
A := A div 10;
end;
writeln(cnt);
end.
A, cnt
A
cnt := 0
A > 1
cnt := cnt + mod(A, 10)
A := div(A, 10)
cnt
.
1. , 111.
2. (
). :
) , ;
) , : .
,
, , ,
. ,
.
. 11 . 10104 2
( , )
.
.
1. 2.
2. . .
, 1.
:
while A > 1 do
:
while (A >= 1) do
while (A > 0) do
while (A >= 0) do .
3. . ( cnt).
.
:
nt := cnt + A mod 10;
:
nt := cnt + 1;
! :
, ,
.
( ,
).
1. ,
.
2. ,
.
3.
, .
. 2 3 , :
) ;
) ,
.
A, 10 9 ,
.
( )
, .
3
© 2015–2016 . .
© 2015–2016 . .

25
. 11 . 10104 3
.
2
1. (
, . 1 ,
. 1 ).
.
2. . 1,
, ,
.
3. (
1, ),
,
, 1
. 1,
( . 1 0
; ,
)
3
30 .
0 10 000 .
,
, 7. ,
,
« ».
,
.
, ,
.
N = 30
DIM A(N) AS INTEGER
DIM I, J, MIN AS INTEGER
FOR I = 1 TO N
INPUT A(I)
NEXT I
...
END
© 2015–2016 . .
const
N = 30;
var
a: array [1..N] of integer;
i, j, min: integer;
begin
for i := 1 to N do
readln(a[i]);
...
end.
. 11 . 10104 4
#include
#define N 30
void main() {
int a[N];
int i, j, min;
for (i = 0; i=100) and (a[i]=100 a[i]

. 11 . 10104 5
MIN = 1000
FOR I = 1 TO N
IF A(I)>=100 AND A(I)

. 11 . 10104 7
. .
1. ) S,
. , S,
S.
) S,
, .
.
2. 3 S,
,
, .
S .
3. S, :
– ,
,
– ,
.
S .
,
( ).
( , )
1. ) , S = 17, … 32.
. S
, 33 .
) ( ),
S = 16 .
17, 19 32 .
.
2. S: 8, 13, 15. , 1,
. 16 :
, – ,
– . . 1.
, ( ), ,
( ) .
3. S = 12 S = 14 (
).
S = 12, 13, 15,
24 . 24 ,
. , 13 15 ,
. 2. , ( ),
.
. 11 . 10104 8
. ( ) .
(
).
12
1- 1- 2-
( ( (
) ) )
12 + 1 = 13 13 + 3 = 16
12 + 3 = 15 15 + 1 = 16
12 * 2 = 24 24 * 2 = 48
2-
(
)
16 + 1 = 17 17 * 2 = 34
16 + 3 = 19 19 * 2 = 38
16 * 2 = 32 32 * 2 = 64
16 + 1 = 17 17 * 2 = 34
16 + 3 = 19 19 * 2 = 38
16 * 2 = 32 32 * 2 = 64
. 1. , ( S = 12).
>> ,
© 2015–2016 . .
© 2015–2016 . .

. 11 . 10104 9
S = 14, 15, 17, 28
. 17 28 ,
. , 15 , . 2.
, ( ),
.
. ( ) .
(
).
14
1- 1- 2-
( ( (
) ) )
14 + 3 = 17 17 * 2 = 34
14 + 1 = 15 15 + 1 = 16
14 * 2 = 28 28 * 2 = 56
2-
(
)
16 + 1 = 17 17 * 2 = 34
16 + 3 = 19 19 * 2 = 38
16 * 2 = 32 32 * 2 = 64
. 2. , (
S = 14). >> ,
. 11 . 10104 10
.
.
( . ).
,
, ,
,
.
,
: ) ). )
, ,
, ,
. )
, ,
, ,
, ,
, .
, :
) ,
; ) ,
, ,
,
.
, ,
.
,
, ,
– ,
, , ,
, .
,
, , ,
.
, ,
, , , –
, , .
,
,
.
.
,
(. ).
3
© 2015–2016 . .
© 2015–2016 . .

27
. 11 . 10104 11
, 3 , 2
.
1. .
2. .
3. ,
,
S
, 3 2 , 1
.
1. .
2.
S,
.
3. ,
S,
S .
4. S,
S
, 3, 2 0
1
3
–
, 14
.
, ,
( , , Borland
Pascal 7.0), X ,
1000.
,
, .
.
N.
N ,
1000.
:
5
40
1000
7
28
55
© 2015–2016 . .
. 11 . 10104 12
:
28000
( , )
14, :
14 ( )
14,
7, – 2.
, X, .
,
.
:
7 – , 7, 2;
M2 – , 2, 7;
M14 – , 14;
AX – ,
14 ( 14
, MAX = M14).
, X
14*MAX 7*2.
,
.
, ,
, ,
. .
, .
© 2015–2016 . .

. 11 . 10104 13
:
var M7,M2,M14,MAX,dat,res,i,N: longint;
begin
M7 := 0;
M2 := 0;
M14 := 0;
MAX := 0;
readln(N);
for i := 1 to N do
begin
readln(dat);
if ((dat mod 7) = 0) and ((dat mod 2) > 0) and (dat > M7) then
M7 := dat;
if ((dat mod 2) = 0) and ((dat mod 7) > 0) and (dat > M2) then
M2 := dat;
if (dat mod 14 = 0) and (dat > M14) then
begin
if M14 > MAX then MAX := M14;
M14 := dat
end
else
if dat > MAX then
MAX := dat;
end;
if (M7*M2 < M14*MAX) then
res := M14*MAX
else
res := M7*M2;
writeln(res);
end.
© 2015–2016 . .
. 11 . 10104 14
:
M14 = 0
M7 = 0
M2 = 0
MAX = 0
INPUT N
FOR I = 1 TO N
INPUT DAT
IF DAT MOD 7 = 0 AND DAT > M7 THEN
M7 = DAT
ELSE
IF DAT MOD 2 = 0 AND DAT > M2 THEN
M2 = DAT
END IF
END IF
IF DAT MOD 14 = 0 AND DAT > M14 THEN
IF M14 > MAX THEN
MAX = M14
END IF
M14 = DAT
ELSE
IF DAT > MAX THEN
MAX = DAT
END IF
END IF
NEXT I
IF M2 * M7 < M14 * MAX THEN
RES = M14 * MAX
ELSE
RES = M2 * M7
END IF
PRINT RES
END
4
, , ,
.
3 , ,
- ,
,
( ,
).
2 ,
( )
-
.
1 , ,
© 2015–2016 . .

. 11 . 10104 15
,
.
.
.
,
.
:
;
;
;
,
(
, ).
, 4 .
.
.
(«»)
– .
, ,
(,
( priority_queue,
vector, set map ++)).
,
«» . ,
16- (integer BPascal Qbasic)
(
16 ).
, ,
.
1. .
2. ,
.
3. ,
(
).
4.
a[i]*a[i].
5. .
6. «