, , (4, 0). , ?
1) (15, −6)
2) (14, −5)
3) (13, −4)
4) (12, −3)
14. 14 7615
, , , , , , , , . , . ?
15. 15 3768
:
103x + 1110 = 103+1
16. 16 9308
Ȼ |, Ȼ &. :
( ) | |
& | |
& | |
& & |
( ), : & (|) , . , , , , .
17. 17 5528
:
( /\ ) → ( )?
1) ҭ
2)
3) ŭȭ
4) έ
18. 18 733
A 0 10. , , .
for i: = 0 to 10 do
A[i]: = i;
for i: = 0 to 5 do begin
A[10-i]: = A[9-i];
A[i]: = A[i+1];
end;
?
1) 0 1 2 3 4 5 6 7 8 9 10
2) 0 1 2 3 4 5 6 7 8 9 9
3) 1 2 3 4 5 5 5 6 7 8 9
4) 1 2 3 4 5 6 5 4 3 2 1
19. 19 3392
. x, : a b. x, 13, 5.
, , b, X := 0; b:= 10 >0 := mod(,10) := + <b b:= := div(,10) , , b | var x, a, b, c: integer; begin readln(x); a:= 0; b:= 10; while x>0 do begin := x mod 10; a:= a+c; if c < b then b:= c; x:= x div 10; end; writeln(a); write(b); end. |
20. 20 5780
, ( ).
|
|
a, b, t, N, P a:= -25; b:= 25 P:= 130 N:= 0 t a b F(t) > P N:= N+1 N F( x) := 16*(9-x)*(9-x)+127 | var a, b, t, N, P:integer; Function F(x: integer):integer; begin F:= 16*(9-x)*(9-x)+127; end; BEGIN a:= -25; b:= 25; P:= 130; N:= 0; for t:= a to b do begin if (F(t) > P) then begin N:= N+1; end; end; write(N); END. |
21. 21 6787
, :
1. 1,
4.
1, 4. . , 3 15?
22. 22 5785
x1, x2, x3, x4, x5, y1, y2, y3, y4, y5, ?
(x1 → x2) ∧ (x2 → x3) ∧ (x3 → x4) ∧ (x4 → x5) = 1
(y1 → y2) ∧ (y2 → y3) ∧ (y3 → y4) ∧ (y4 → y5) = 1
y5 → x5 = 1
x1, x2, x3, x4, x5, y1, y2, y3, y4, y5, . .
23. 23 4987
( ). , . , NO. , 1000. . .
const n = 4; var i, x: integer; var maximum, count: integer; begin count:= 0; maximum:= 999; for i:= 1 to n do begin read(x); if x mod 2 <> 0 then begin count:= count + 1; if x > maximum then maximum:= i end end; if count > 0 then begin writeln(count); writeln(maximum) end else writeln('NO') end. | n = 4 i, x maximum, count count:= 0 maximum:= 999 i 1 n x mod(x, 2) <> 0 count:= count + 1 x > maximum maximum:= i count > 0 count, maximum "NO" |
.
1. , : 2 9 4 3
2. , , , , .
3. ( ). , . :
|
|
1) , ;
2) , , . .
. , , , , . , .
24. 24 7469
, 2016 . , , . , 6 , 2, 3, 1, 5, 6, 4, , , 2, 3 5.
. , . , , .
const N=2016; var a: array [1..N] of integer; i, k: integer; begin for i:=1 to N do readln(a[i]); end. | N=2016 a[1:N] i, k i 1 N a[i] |
, . ( , Free Pascal 2.4). , .
25. 25 10301
, , . . , . . , 7 , 8 49 . , , .
, 100 . , , , 100 .
S , 1 ≤ S ≤ 99.
, , . - , , .
. .
1. ) S ? .
) S, , . .
2. S, , () , () , , .
S .
3. S,
- , ,
|
|
- , .
S . , ( ). , , - .
26. 26 5290
(, ). N . ( , , Borland Pascal 7.0), , .
N . N :
<><><><>
<> , , 20 , <> , , 20 , <> , , <> 100 500, .
<> <>, <> <>, <> <> .
:
225
3 , , . - , 0.
:
7 5 0