Скачать PDF-файл (3 Мб).

-

.. , ..

-

- 7-11

- 2008

2

-

30.05.2008 .

6

: .. , ..., , - - .. , ..-.., - - - -

..

47 -: - 7-11 . / .. , .. . -: , 2008. 284 . ISBN -

. . - . - 7-11 , , - .

74.263.2

ISBN

- - - , 2008 .., .., 2008

74.263.2 47

3

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19

051. !!! . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46

101. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 74

151. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 100

201. . . . . . . . . . . . . . . . . . . . . . . . . . . . 125

251. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 158

301. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 184

351. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 208

401. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 230

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 243

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 252

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 261

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 261

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 265

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 269

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 271

- . . . . . . . . . . . . . . . . . . 278

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 282

. . . . . . . . . . . . . . . . . . . . . . 283

4

. - , http://acm.dvpion.ru ( 2008 http://acmp.ru).

, . , - , - , .

- . , 350 . 1 100, , .

, - . - . , , . -, . - , , (http://acm.timus.ru), . - .

: () , -, - . - (http://neerc.ifmo.ru/school/io), .

, . .

- . - .

2007-2008 - , -- , - -. - . - - , , - - - , .

- , - .

, . ([email protected] / [email protected]). - http://zvn.irohmao.ru.

5

, - . , , .

, , , - . , - , IQ , , - .

, . , . - , , - , , -, , . , , , - , . , - , , , .

:

, ( -), , , , , ;

, ;

, ;

, ;

( , );

.

, .

. .. - , , . INPUT.TXT, - OUTPUT.TXT. .. -: , , -. , , http://acm.timus.ru, - - . , .

6

( 1 ):

A+B (: 1 . : 16 : 2%)

.

INPUT.TXT , 109.

OUTPUT.TXT . INPUT.TXT OUTPUT.TXT

1 2 3 5

- . INPUT.TXT, ( ), 2 OUTPUT.TXT. 16 1 . , ( , - 108 ). - ( ), - . - 2 3 5, , 2+3=5.

- . - :

Turbo Pascal 7.1 Borland C++ 3.1 Borland Delphi 7.0 Borland C++ Builder 5.0 Microsoft Visual C/C++ 7.1 Java 2 SDK 1.5 ++, - -

, , - Delphi. ++, - .

- , : // 1 "A+B" C

#include < stdio.h >

long a,b;

int main(){

freopen("input.txt","r",stdin);

freopen("output.txt","w",stdout);

scanf("%ld%ld",&a,&b);

printf("%ld",a+b);

return 0;

}

7

{ 1 "A+B" Pascal}

var a, b : longint;

begin

assign(input, 'input.txt'); reset(input);

assign(output, 'output.txt'); rewrite(output);

read(a, b);

write(a + b);

end.

// 1 "A+B" Java

import java.util.*;

import java.io.*;

public class Main{ // Main

public static void main(String[] argv) throws IOException{

new Main().run();

}

PrintWriter pw;

Scanner sc;

public void run() throws IOException{

sc = new Scanner(new File("input.txt"));

int a=sc.nextInt(), b=sc.nextInt();

pw = new PrintWriter(new File("output.txt"));

pw.print(a+b);

pw.close();

}

}

' 1 "+" Basic

open "input.txt" for input as #1

open "output.txt" for output as #2

input #1,a#,b#

print #2,a#+b#

close #1

close #2

, , .

acm.dvpion.ru

. , 350 . 1 100, , .

INPUT.TXT OUTPUT.TXT, . - - *.pas, *.dpr, *.c, *.cpp. , - Pascal, ++, Java Basic, :

Borland Delphi 6.0 Microsoft Visual C++ 6.0 Java 2 SDK 1.5 Microsoft QBasic 4.5

10 -, . . - , .

8

, . , ( ). :

1 Accepted

- -

2 Wrong answer . -

-

3 Time limit exceeded

. - -

-

4 Presentation Error OUTPUT.TXT

,

5 Compilation error . - -

-

6 Memory limit

exceeded

. - - .

,

7 Runtime error

. .

, - - , - .. , C++ - "return 0" -

8 Compiling

9 Running

10 Waiting ,

, , 1 A+B -. - Pascal C. !!!

9

-

. , . . , , , .

, -

.

01: . . . 02: . 03: . 04: . 05: . 06: . 07: . 08: . 09: .

01: . . . ,

.. , , , , , - .

, - . , - , . : //



{ }

assign(input, 'input.txt'); reset(input);

assign(output, 'output.txt'); rewrite(output);

, , . .

, - . - . 001: A+B. 108: . 033: . 092: . 004: .

10

02: . , ,

. , .

, switch ?, Pascal case. , - :

if(a > b) max=a; else max=b;

: max=(a>b)?a:b;

025: . 021: . 008: . 052: . 026: .

03: . . , -

. , - .

, : 1. for i=1..n{

;

}

2. while(){

;

}

3. do{

;

}while();

106: . 081: . 043: . 063: . 002: .

04: . , -

. . , , . , .

, - n-1, n -. , . : // , 0 9

int a[10];

{ , 1 10}

var a : array [1..10] of integer;

// , 1 10

int a[1..10];

11

10 :

-

. i a[i]. - . , - , : N , N . N - : const MaxN=100;

int i,n,a[1..MaxN];

read(n);

//

for i=1..n{

read(a[i]);

}

//

for i=1..n{

write(a[i],' ');

}

149: . 082: . 039: .

05: . ( -

) . {Ai} -, i j, i < j Ai Aj. Ai < Aj. - .

. -

N , . , .

, , . , , , N. -, , , .., - O(ln(N)), O(N), O(N2) O(eN) . , - O(N2) , N2 , 100*N2, N2 : , , N , 10 . , 4, 9 100 .

12

O(n*ln(n)), N = 300 000 (-). -: , , , .

O(N2), N 5000 ( ). , , , , . : , , .

, (, ). - , 107 ! , : .

, (, ), . . , , . , a[i] -, n , 1 n.

, , -

1- n-. - 1-, 2-. , , - 3- 3- .. (n-1)- . - , : for i=1..n-1{

for j=i+1..n{

if(a[i] > a[j]) a[i] a[j];

}

}

, , ,

: 1- . . , () , , . - , , 1- 2- - .. , , : for i=1..n-1{

for j=n-1..i{

if(a[j] > a[j+1]) a[j] a[j+1];

}

}

, O(n*ln(n)). - : , - , ,

13

. , - l- r- : sub QuickSort(l,r){

x=(l+r) div 2;

i=l; j=r;

do{

while(a[i] < p) i=i+1;

while(a[j] > p) j=j-1;

if (i i) QuickSort(i, r);

}

QuickSort(1, n). 119: . 032: . 041: .

06: , -

. , , , . - , n m , -, i- j- a[i][j].

, , a[i] i, , , m , - : a[i][1], a[i][2], ... , a[i][m]. i- -. , , , , char, a[i] , - . , :

n- , (n-1)- .

, 3- ( ), a[i][j][k]. - , - .

- , , n=m ( ) . - : (, , Lines ..), , , .. .

-: n m , n m , , , , : 3 5

7 8 2 3 1

5 3 2 6 3

9 3 5 2 0

14

, . . , i , j i . - : int a[1..100][1..100];

//

read(n,m);

for i=1..n{

for j=1..m{

read(a[i][j]);

}

}

//

for i=1..n{

for j=1..m{

write(a[i][j], ' ');

}

writeln; //

}

- , . :

for i=2..n{

for j=1..i-1{

a[i][j] a[j][i];

}

}

for i=1..n-1{

for j=1..n-i{

a[i][j] a[n-j+1][n-i+1];

}

}

027: . 058: . 088: .

07: , -

10 : 0..9, . - , . , 10 . , - 0 1; . , 10, - ; , : 0..9, A, B, C, D, E F.

15

, , , , . - :

k

k, - , . , - , . :

-

2 36. , 26 (10 + 26 = 36 ). , . S , K- , X . - : read(S);

X=0;

for i = 1..len(S){

X = X*K+S[i];

}

write(X);

X S : read(X);

l=0;

do{

l=l+1;

S[l] = X mod K;

X = X div K;

}while(X>0);

write(reverse(S));

k- m, k- 10-, 10- m-. . , . , 2- 4-, 8-, 16- ; 3- 27- 5- 25-. . , 4- - 2- 2- , 8- 3 2-, 16- 4 2- . , 101100101010011011 16- 4-:

16

0010 1100 1010 1001 1011 16- : 2CA9B, .. 0010 = 2, 1100 = B, 1010 = A, 1001 = 9 1011 = B. , 16- 2- . 022: . 059: . 275: 7.

08: ,

, . - , .. . - , . . ...

Z : {... , -3, -2, -1, 0, 1, 2, 3, ...}. - N: {1, 2, 3, ...}.

, , 1 . . 10 : 2, 3, 5, 7, 11, 13, 17, 19, 23 29. :

; , -.

, n/ln(n) -, n.

n sqrt(n), 2 ( ) , sqrt(n).

, ; , 5

n, - (n, 2*n)

, 2n-1. , n=2, 3, 5, 7, 13, 17, 19, 41, 47, 61, 89, 10, 127, ... 44 n=32582657 10 , . . : .

, 122 +n

. 2n+1 . 5 : 3, 5, 17, 257, 65537; , 5 n 32 .

, , . , 28 , .. 28=1+2+4+7+14. 10 : 6, 28, 496, 8128, 33550336, 8589869056, 137438691328, 2305843008139952128, 2658455991569831744654692615953842176, 191561942608236107294793378084303638130997321548169216. , 2p-1(2p-1), 2p-1 - . - .

17

, ( ) ( ) . : . - , , . 8 : 220 284, 1184 1210, 2620 2924, 5020 5564, 6232 6368, 10744 10856, 12285 14595, 17296 18416.

, , , . , 1634 = 14 + 64 + 34 + 44. - : 1, 2, 3, 4, 5, 6, 7, 8, 9, 153, 370, 371, 407, 1634, 8208, 9474, 54748, 92727, 93084, 548834, 1741725, 4210818, 9800817, 9926315, 24678050, 24678051, 88593477, 146511208, 472335975, 534494836, 912985153, 4679307774, 32164049650, 32164049651 ... .

m- , , - m, m . .

, ( -) . , 202, 2 + 0 + 2 = 4, 2 + 1 + 0 + 1 = 4 (202 = 2 * 101). . . - , . 29 928 1 000 000. 50 : 4, 22, 27, 58, 85, 94, 121, 166, 202, 265, 274, 319, 346, 355, 378, 382, 391, 438, 454, 483, 517, 526, 535, 562, 576, 588, 627, 634, 636, 645, 648, 654, 663, 666, 690, 706, 728, 729, 762, 778, 825, 852, 861, 895, 913, 915, 922, 958, 985, 1086.

148: . 014: . 147: . 349: . 323: . 036: .

09: , -

, . , , Java, - .

. , . 1- , 2- .. . 0- - . , 154 - : const maxsize=100;

int a[maxsize];

a[0]=3; a[1]=4; a[2]=5; a[3]=1;

, 4 , .. , - 32-, , 4 . base=10000 10000- , - 34 .

18

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

, , -, - . , -, : void readlong(int *a){

int i;

string s;

read(s);

a[0]=len(s);

for i=1..len(s){

a[i]=ord(s[i])-48;

}

}

void writelong(int *a){

for i=a[0]..1{

write(a[i]);

}

}

. - , 0 , -1 1 : void complong(int *a, int *b){

if (a[0] < b[0]) return -1;

if (a[0] > b[0]) return 1;

for i=a[0]..1{

if(a[i] < b[i]) return -1;

if(a[i] > b[i]) return 1;

}

return 0;

}

103: A+B 143: A-B 144: A*B 145: A div B 172: A mod B 146:

19

001. A+B (: 1 . : 16 : 2%)

.

INPUT.TXT , 109.


1 2 3 5

002. (: 1 . : 16 : 19%)

1 N.

INPUT.TXT - N, 104.

OUTPUT.TXT 1 N. INPUT.TXT OUTPUT.TXT

1 5 15

:

Sn = (a1+an)*n/2. , -: read(n);

s=0;

for i=1..n{

s=s+i;

}

write(s);

! , - , N. , -! , - .

003. ! (: 1 . : 16 : 8%)

. - , 5. ( ) , 5. : , 5 , -

20

, 25 . , , 125 - 12 13 25, .. 12*13=156 25, 15625, .. 1252=15625. , , 5, , .

INPUT.TXT , 5, 4*105.

OUTPUT.TXT - A2 - . INPUT.TXT OUTPUT.TXT

1 5 25

2 75 5625

3 4255 18105025

004. (: 1 . : 16 : 4%)

: , -, , . - , -. - , . : . , - . - , , - . . - . , 487, - 784. 784 487, - 297, 2, . , - . - , . , , : , , .. 9-2=7. - , .

INPUT.TXT , - - .


1 5 594

2 9 990

3 7 792

21

- , .

, x 1 9, : x, 9 9-x.

, ( 9) . : ...

scanf("%d",&x);

if(x==1) printf("198");

if(x==2) printf("297");

if(x==3) printf("396");

if(x==4) printf("495");

if(x==5) printf("594");

if(x==6) printf("693");

if(x==7) printf("792");

if(x==8) printf("891");

if(x==9) printf("990");

...

, . 9, 99 999 , . , - .

, .

005. (: 1 . : 16 : 25%)

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

INPUT.TXT N - (1 N 100). N , . 1 31. .

OUTPUT.TXT , - , , , . - YES, NO . , . INPUT.TXT OUTPUT.TXT

1 5

4 16 19 31 2

19 31

4 16 2

YES

2 8

29 4 7 12 15 17 24 1

29 7 15 17 1

4 12 24

NO

22

006. (: 1 . : 16 : 18%)

. , . .. C7-D5, , E2-E4, . - : -, D9-N5, . - !

INPUT.TXT , -. , 5 .

OUTPUT.TXT YES, , ( ), -, NO. -, ERROR. INPUT.TXT OUTPUT.TXT

1 C7-D5 YES

2 E2-E4 NO

3 BSN ERROR

007. (: 1 . : 16 : 40%)

. . . !

INPUT.TXT . 10100.

OUTPUT.TXT - , . INPUT.TXT OUTPUT.TXT

1 5 7 3 7

2 987531 234 86364 987531

3 189285 283 4958439238923098349024 4958439238923098349024

008. (: 1 . : 16 : 5%)

. - 1 10 . , . , ,

23

. ( ) 1 10 , - . , 101 1001 , - :

(101)2=1*22+0*21+1*20=4+0+1=5

(1001)2=1*23+0*22+0*21+1*20=8+0+0+1=9

5 9 - 45. - . 45 2 ( -), , 0:

-

. : (101)2 * (1001)2 = (101101)2. 1 100 , , . , .

INPUT.TXT A, B C . A B 102, C 106.

YES , A*B=C NO - . INPUT.TXT OUTPUT.TXT

1 8 54 432 YES

2 16 19 777 NO

, , -

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

, : . , YES NO . -, .

. , , YES Yes yes. , , . , 0 100 . DOS -. 4- long, int. , Windows .

24

009. (: 1 . : 16 : 27%)

, , - , - , . , . , , . ?

INPUT.TXT N - . N , . . 102 .

OUTPUT.TXT , - : , - . 3*104. INPUT.TXT OUTPUT.TXT

1 5

-7 5 -1 3 9

17 -15

2 8

3 14 -9 4 -5 1 -12 4

26 180

3 10

-5 1 2 3 4 5 6 7 8 -3

36 5040

010. (: 1 . : 16 : 17%)

, - . A*X3 + B*X2 + C*X + D = 0. . , , , - . , [-100, 100]. , - , .. . , - !

INPUT.TXT 4 : A, B, C D - . 32768.

OUTPUT.TXT . . INPUT.TXT OUTPUT.TXT

1 1 -3 0 0 0 3

2 3 -15 18 0 0 2 3

3 1 -7 -33 135 -5 3 9

25

011. (: 1 . : 16 : 68%)

. -, , - . - , . N. . . , - K N. -, . -, K=3 N=4, : 1+1+1+1, 1+1+2, 1+2+1, 2+1+1, 2+2, 1+3, 3+1. .. 7 .

INPUT.TXT K

N (1 K N 300). , - , N .


1 1 3 1

2 2 7 21

3 3 10 274

012. (: 1 . : 16 :

45%) ,

, , . , - -. , : , , , - . , , - , . , , ( , - ). . - , . : ? !

26

INPUT.TXT N

(1 N 1000) , N , - : X Y X1 Y1 X2 Y2 X3 Y3 X4 Y4 (X,Y) - (X1, Y1, X2, Y2, X3, Y3, X4,Y4) - , .

, 30000

OUTPUT.TXT , . INPUT.TXT OUTPUT.TXT

1

3

6 6 3 6 6 9 8 7 5 4

13 5 9 2 9 8 12 8 12 2

3 2 2 1 2 3 6 3 6 1

2

013. (: 1 . : 16 : 26%)

. . -: , . , . - , : , - , -. , . , - , . , 5671, 7251, 1 ( 1 - ), 2 ( 7 5 ). -, . , .

INPUT.TXT - A B , , .

OUTPUT.TXT - . INPUT.TXT OUTPUT.TXT

1 5671 7251 1 2

2 1234 1234 4 0

3 2034 6234 2 1

014. (: 1 . : 16 : 24%)

, () - a b.

INPUT.TXT - , 46340.

27

OUTPUT.TXT

. INPUT.TXT OUTPUT.TXT

1 36 27 108

2 39 65 195

() a b -

, a b. [a, b], (m, n) LCM(a, b). , (16, 24)=48.

: - a b (a, b)*(a, b)=a*b, , (a, b)=a*b/(a, b).

, - , 148.

015. (: 1 . : 16 : 18%)

Milky Way Snowflake N , - . Milky Way - Snowflake. , , , . , - Snowflake.

INPUT.TXT N (0 N 100). - N N , -. , (i, j) , i- j- , , .

OUTPUT.TXT , Snowflake. INPUT.TXT OUTPUT.TXT

1

5

0 1 0 0 0

1 0 1 1 0

0 1 0 0 0

0 1 0 0 0

0 0 0 0 0

3

016. (: 1 . : 16 : 55%)

, , -. , , N .

INPUT.TXT N (1 N 100) .

OUTPUT.TXT , N .

28

INPUT.TXT OUTPUT.TXT

1 3 2

2 6 4

017. (: 1 . : 16 : 31%)

, , . . - . . ( ) -, . , , . , : ? , .

INPUT.TXT N , - (2 N 30000). N , - . ( , ). , , 32000.


1 13

5 3 1 3 5 2 5 3 1 3 5 2 5

6

2 4

1 1 1 1

1

3 4

1 2 3 1

3

018. (: 1 . : 16 : 42%)

N. N! - :

N! = 1 * 2 * 3 * * (N-1) * N, 0! = 1. : N! = (N-1)! * N

INPUT.TXT -

N (N < 1000).

OUTPUT.TXT N!. INPUT.TXT OUTPUT.TXT

1 1 1

2 3 6

3 5 120

29

019. , (: 1 . : 16 : 34%)

88 : , . , . , . , - , D5 .

INPUT.TXT -: , . - ( A H) ( 1 8).


1 D1 D3 E5 29

020. (: 1 . : 16 : 38%)

a1, a2, a3, , an-1, an , - : 1) a1 < a2 > a3 < > an-1 < an, 2) a1 > a2 < a3 > < an-1 > an.

. - .

INPUT.TXT N - . N - {ai}. : N

30

INPUT.TXT -

. , - 105.


1 100 500 1000 900

2 36 11 20 25

. A, B C (ABC) C-A . - , . .

, . -, 3 . B A , . A C 3 . B C C . -:

-

: x=a; a=b; b=x;

a b : a^=b^=a^=b;

022. (: 1 . : 16 : 16%)

, , - . . .

INPUT.TXT n (0 n 2*109).

OUTPUT.TXT n. INPUT.TXT OUTPUT.TXT

1 5 2

2 7 3

31

, .. -

. : read(n);

s = 0;

while(n>0){

s = s + n mod 2;

n = n div 2;

}

write(s);

023. (: 1 . : 16 : 13%)

, . - - n , n . , , .

INPUT.TXT n (0 n 1000), .

OUTPUT.TXT n. INPUT.TXT OUTPUT.TXT

1 6 12

2 10 18

024. (: 1 . : 16 : 46%)

, . , n , - .

m , - . , - .

, n m , n , m .

INPUT.TXT n m (0 m , n 1000).


1 5 3 4

TTTTT, : TTT.., .TTT., ..TTT, T.T.T.

32

025. - (: 1 . : 16 : 3%)

. , - , . .

INPUT.TXT A B, 2*109.

, A > B =, A=B. INPUT.TXT OUTPUT.TXT

1 5

7

<

2 -7

-12

>

3 13

13

=

-

if, else. , - , : scanf("%d%d", &x, &y) read(x,y) , .

026. (: 1 . : 16 : 17%)

. , .

INPUT.TXT . - x y ( , - 5000) ( 1 r 1000).

OUTPUT.TXT YES, , NO . INPUT.TXT OUTPUT.TXT

1 0 0 2

0 3 2

YES

2 1 1 1

4 4 1

NO

,

r1 r2. - :

r = sqrt( (x2-x1)2 + (y2-y1)2 ) ,

, r1, r2 r. , , .. (r=r1+r2), (r=0).

33

. .. , r1+r2 r r+r2 r1 r+r1 r2. . - .

027. (: 1 . : 16 : 31%)

. - . , - : , w h. n , , -. .

INPUT.TXT w h (1 w, h 100). n (1 n 5000) -. n . x1, y1, x2, y2 , (x1, y1) (x2, y2) -.


1

5 5

2

1 1 3 3

2 2 4 4

18

2

6 7

3

0 0 5 5

1 1 4 4

2 2 3 3

17

, -

- , , .. - (0, 0) - (w, h). , - , , 18 . , , -, .. (0, 0) (w, h). , , , , - , , .. (0, 0) (w, h). , , , 18 .

34

. a[1..n][1..m] . . , . 50 000 000. , 1 . , , . -, .

: int a[1..100][1..100]={0...0};

read(w,h,n);

for i=1..n{

read(x1,y1,x2,y2);

for y=y1+1..y2{

for x=x1+1..x2{

a[y][x]=1;

}

}

}

c=0;

for y=1..h{

for x=1..w{

c=c+1-a[y][x];

}

}

write(c);

028. (: 1 . : 16 : 19%)

, , . L A. B A L, L - . , L, B .

L, , . , L.

INPUT.TXT 4 : x1, y1, x2, y2 , L. - 2 xA yA . - 108 .

OUTPUT.TXT xB yB B. INPUT.TXT OUTPUT.TXT

1 0 0 0 1

10 10

-10 10

2 0 0 1 0

10 10

10 -10

35

029. (: 1 . : 16 : 38%)

, - ? , - ? , .

-. - ( ), . . , |y2-y1| , y1 y2 , - . , , - , 3*|y3-y1| . , .

, . , -, ?

INPUT.TXT n (1 n 30000). n , 30000 -, .

OUTPUT.TXT - , ( , , cheat- ). INPUT.TXT OUTPUT.TXT

1 3

1 5 10

9

2 3

1 5 2

3

030. (: 1 . : 16 : 35%)

. , . , - , .

, , . - . , .

INPUT.TXT - . . hh:mm:ss (0 hh < 24, 0 mm < 60, 0 ss < 60). hh, mm, ss - . .

OUTPUT.TXT 10 . i- , i-1.

36


1

23:59:58

23:59:59

0

0

2

2

0

4

0

0

1

3

2

13:24:09

13:24:40

5

45

45

45

36

3

3

3

3

4

031. (: 1 . : 16 : 57%)

P[1..n] n 1 n, . . 1, 3, 4, 5, 2 ( n=5) 3, 2, 1 ( n=3), , -, 1, 2, 3, 4, 5, 1 , 1 .

i P, P[i] = i. , 1, 3, 4, 2, 5 : 1 5, 4, 3, 2, 1 .

: n k. n k - .

INPUT.TXT n (1 n 9) k (0 k n).


1 5 2 20

2 9 6 168

3 2 1 0

4 9 0 133496

032. (: 1 . : 16 : 33%)

. - , , , , a b . , .

37

, . a b, a-b (, , , ), , . , -. , .

INPUT.TXT a b (-109 < a, b < 109).

OUTPUT.TXT , a, - b. INPUT.TXT OUTPUT.TXT

1 18

10

71

2 1

-23

33

a-b , a -

, b, , . , , , , . . , , - , 0 ( , , , - , ).

, , . , - . , , . a b - a-b.

4- (long longint ), .. 1999999998 . a b , -, , 19 , 8- int64 __int64.

033. (: 1 . : 16 : 4%)

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

, , . , . , , . , .

, .

38

INPUT.TXT 2 -

, .

OUTPUT.TXT 2 , . INPUT.TXT OUTPUT.TXT

1 4 7 6 3

, : ?

, : c=a+b-1, , .. , ( -) . c-a , c-b .

, - . , , - , , . , b-1 , a-1 .

a b, b-1 a-1!

034. (: 1 . : 16 : 46%)

n - . , - k . , , (, -).

, -, . , , .

INPUT.TXT : n (1 n 105) k (1 k 5) . - n . , .

OUTPUT.TXT YES, - , NO . INPUT.TXT OUTPUT.TXT

1 10 5

0123456789

NO

2 13 2

0123400056789

YES

035. (: 1 . : 16 : 11%)

k . , , n m , d = 19m + (n + 239)*(n + 366) / 2 . d, .

.

39

INPUT.TXT k (1 k 10000)

. k ni (1 ni 1000) mi (1 mi 26ni

2) i- .

OUTPUT.TXT k . i- i- . INPUT.TXT OUTPUT.TXT

1

4

2 0

13 20

5 23

18 6

44344

48134

45699

49458

2 2

15 20

1000 26000

48767

1340237

036. (: 1 . : 16 : 38%)

( -, ) , n > 1 p n < p < 2n. - 1845 ( n=3000000) 1850 . 1920 , 1923 .

, n p n < p < 2n.

, , .

INPUT.TXT n (2 n 50000).


1 2 1

2 239 39

3 3000 353

, 2*n ,

(n, 2*n). 349 . , , .

037. (: 1 . : 16 : 34%)

, Y ( X Y) , x X - y=Ax Y. X Y . - A X Y q, q

40

[0, 1), x X A||x|| q*||x|| ( ||x|| - - x x ). , - q , , q .

- q.

INPUT.TXT n (1 n 100) q (0 q < 1), 3 . n 4 , 1000, - X Y.

OUTPUT.TXT : Yes q No . INPUT.TXT OUTPUT.TXT

1 2 0.5

0 10 5 0

10 0 0 1

Yes

2 2 0.1

0 10 5 0

10 0 0 1

No

3 2 0.9

0 0 0 0

10 0 0 1

Yes

038. - 2 (: 1 . : 16 : 60%)

? , ! , , . , . - n . . , - , . , . , , -, .

INPUT.TXT n (0 < n < 100). n , 1000.

OUTPUT.TXT 1, - , 2 0 . INPUT.TXT OUTPUT.TXT

1 4

3 2 5 4

1

2 6

5 5 5 5 5 5

0

3 9

2 1 3 2 9 1 2 3 1

2

4 10

2 5 3 12 4 6 13 7 1 3

1

41

039. (: 1 . : 16 : 32%)

, - . , , - . , - .. . -, . - -. , - N ( 0 N-1). , , N - . , 1 - . , 0- 0- 1 .

INPUT.TXT N (0 < N 100). N , 100, - C[i] 1 i- .

OUTPUT.TXT , N . INPUT.TXT OUTPUT.TXT

1 5

73 31 96 24 46

380

2 10

1 2 3 4 5 6 7 8 9 10

100

3 10

10 9 8 7 6 5 4 3 2 1

55

. : , - . .. - C[k] (k=p+1..n-1) C[k]*(k-p+2) .., p c . p=-1.

040. 2^N (: 1 . : 16 : 30%)

2n.

INPUT.TXT n (0 < n < 1000).

OUTPUT.TXT 2n. INPUT.TXT OUTPUT.TXT

1 3 8

2 10 1024

3 72 4722366482869645213696

42

041. (: 1 . : 16 : 29%)

, . , -100 100 . N . , , . . . .

INPUT.TXT N (N 106). , 100 .


1 3

9 -20 14

-20 9 14

2 10

12 7 92 5 18 4 32 48 11 74

4 5 7 11 12 18 32 48 74 92

, ,

( ). , , (DigitalSort).

, , x . d[x], - a[i], . d[x] - a[i], x. : a[i] d[a[i]] . - d[x] x ( - ) x. O(N).

: int d[-100..100]={0...0};

read(n);

for i=1..n{

read(x);

d[x]=d[x]+1;

}

for x=-100..100{

for i=1..d[x]{

write(x, ' ');

}

}

.

43

042. (: 1 . : 16 : 40%)

, . , ? , , ? , - . , . , 3 , 3, 4 5 -, 3*4*5 = 60. , , -? .

INPUT.TXT N (0 < N < 100) .

OUTPUT.TXT , N . INPUT.TXT OUTPUT.TXT

1 6 9

2 8 18

3 13 108

043. (: 1 . : 16 : 16%)

.

INPUT.TXT - ( ). 100.


1 00101110000110 4

1 -,

( ). , , . . , , . c=max=0;

while(not EOF){

read(x);

if(x=='0') c++; else c=0;

if(c>max) max=c;

}

write(max);

44

2 . -

k strstr pos . , - - , . - . p='';

read(s);

while(p s) s=s+'0';

write(len(s)-1);

044. (: 1 . : 16 : 20%)

, >, >-->

45

OUTPUT.TXT .


1 0 3

2 25 2.7182818284590452353602875

3 13 2.7182818284590

047. (: 1 . : 16 : 26%)

, a b, a b, , a b. , 124 123, , . , 3 111, , .

n. ( n - n), n.

n (1 n 105).


1 10 5

2 239 239

048. (: 1 . : 16 : 23%)

, a b, a b, , a b. , 124 123, , . , 3 111, , .

n. d ( n - n), c n , d.

INPUT.TXT n (1 n 105000).


1 10 10

2 239 1

049. (: 1 . : 16 : 35%)

n n, {0,1,2,3,4, 5,6,7,8,9, a, b, c, d, e, f, g, ?}. : 0 9 ; a 0,1, 2, 3; b 1,2,3,4;

46

c 2,3,4,5; d 3,4,5,6; e 4,5,6,7; f 5,6,7,8; g 6,7,8,9; ? 0 9;

: p1 p2. S1 , - p1 , Sw , p2. , .

INPUT.TXT p1, p2. , 9.


1 ???

abc

64

2 ???

000

1

3 abc

999

0

050. (: 1 . : 16 : 44%)

s sksk+1sk+2s|s|s1s2sk-1 k, |s| - s. s sisi+1sj-1sj - i j. a b. a, b.

INPUT.TXT a (1 |a| 1000). - b (1 |b| min(100,|a|)). - .


1 abcabc

abc

4

2 abcabc

acb

0

3 aaaaaaa

aa

6

4 aAaa8aaAa

aAa

4

051. !!! (: 1 . : 16 : 26%)

1: n!!...!=n(n-k)(n-2k)...(n mod k), n k, n!!...!=n(n-k)(n-2k)...k, n k ( ! k ).

47

2: X mod Y X Y. , 10 mod 3 = 1; 3! = 321; 10!!! = 10741; n k 1.

?

INPUT.TXT . n (1 n 10), , k (1 k 20).

OUTPUT.TXT n!!..! . INPUT.TXT OUTPUT.TXT

1 10 !!! 280

2 9 !! 945

3 3 ! 6

052. (: 1 . : 16 : 12%)

? , . -, . .. 385916 , .. 3+8+5=9+1+6. , - .

INPUT.TXT N (0 N < 106).

OUTPUT.TXT YES, N - NO . INPUT.TXT OUTPUT.TXT

1 385916 YES

2 123456 NO

. -

. 1. x

, x1, x2 .. x6. , , - x1+x2+x3 x4+x5+x6. ? . , x x%10 ( x 10), - x x/100000 ( 100000). - ? (n ), 10n , - 10 . , x3=x/1000%10.

2. , 6 . , ASCII- ASCII- . . ( ord ).

48

053. (: 1 . : 16 : 32%)

n m , - i- j- ij ( ).

. , , , , (- ).

. . , , 3, , , - 5, .

, . , - n m. , .

INPUT.TXT n m (1 n, m 1000).

OUTPUT.TXT , - , , , . , . INPUT.TXT OUTPUT.TXT

1

10 10 RED : 21

GREEN : 39

BLUE : 36

BLACK : 4

2

5 2 RED : 5

GREEN : 2

BLUE : 2

BLACK : 1

054. (: 1 . : 16 : 28%)

, , - . X - , Y K(x, y) (x X, y Y). X Y , -, K .

, X = {1, , n}, Y = {1, , m}. - K. maxi=1..nminj=1..m Kij . minj=1..mmaxi=1..n Kij. , , - , .

K . .

INPUT.TXT n m (1 n, m 100). n m . j- i- Kij . Kij - 1000.

OUTPUT.TXT .

49


1 3 3 4 -1 -3

-2 1 3

0 2 -3

-2 2

2

3 4

-1 0 2 1

-2 0 1 0

2 1 -1 -2

-1 1

055. (: 1 . : 16 : 31%)

, . , ! , . , , . - , .

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

INPUT.TXT (x1, y1) (x2, y2) . r , s - . : 1 x1, y1, x2, y2, r 100, 1 s 10

5. , , -, 10-3.

OUTPUT.TXT YES, (.. ) NO . INPUT.TXT OUTPUT.TXT

1

1 2

3 4

2

22

YES

2

1 1

100 100

1

7

NO

056. J J (: 1 . : 16 : 29%)

- J J. , , LiveJournal. - LiveJournal'. .

: , , , .

50

(Friends), - (Mutual Friends), , - , (Also Friend of).

INPUT.TXT n (0 n 200) - . n , . (n + 2)- m (0 m 200) -, . , . , .

20 , (-). .

OUTPUT.TXT (Friends), (Mutual Friends), , , (Also Friend of). . , . INPUT.TXT OUTPUT.TXT

1

3

vasya-pupkin

bill-hates

ivan-ivanov 2 vasya-pupkin

destroyer

Friends: bill-hates, ivan-

ivanov, vasya-pupkin

Mutual Friends: vasya-pupkin

Also Friend of: destroyer

2 0

0

Friends:

Mutual Friends:

Also Friend of:

057. (: 1 . : 16 : 33%)

- . , N . - (xi, yi). - (xnet, ynet).

N : 1. ; 2. . .

. - p . : ? , c . - !

INPUT.TXT N, p : 1 N 103, 1 c 104, 1 p 109 . N (xi; yi). - (xnet, ynet). 1000 .

OUTPUT.TXT YES, NO .

51


1

3 2 6

0 0

1 0

0 1

-1 0

YES

2

3 1 5

1 1

2 2

3 3

4 4

NO

058. (: 1 . : 16 : 28%)

, n m , - . , 2 2, .

, , 4 4, , , - 3 3 .

. ,

.

INPUT.TXT t (1 t 10) . . , n m (1 n, m 100), n , m , . j- i+1- aij . , aij , .

OUTPUT.TXT , YES, , NO . INPUT.TXT OUTPUT.TXT

1

3

1 1

0

4 4

1 0 1 0

1 1 1 0

0 1 0 1

0 0 0 0

3 3

0 0 1

0 0 1

1 1 1

YES

YES

NO

52

-

, - . - 22 : , . , NO YES - . - : Ok=true;

for i=1..n-1{

for j=1..m-1{

if( (a[i][j]+a[i][j+1]+a[i+1][j]+a[i+1][j+1]) mod 4 == 0 ) Ok=false;

}

}

if(Ok) write("YES") else write("NO");

, . , - 22. , , .

059. (: 1 . : 16 : 25%)

n. k- .

, n = 239, k = 8. n 357, 3 5 7 (3 + 5 + 7) = 90.

INPUT.TXT : n k (1 n 109, 2 k 10). .

OUTPUT.TXT ( -). INPUT.TXT OUTPUT.TXT

1 239 8 90

2 1000000000 7 -34

n k- .

- sum, mult. sum , mult . .

: read(n,k);

sum=0; mult=1;

while(n>0){

sum = sum + n mod k;

mult = mult * (n mod k);

n = n div k;

}

write(mult-sum);

53

060. (: 1 . : 16 : 39%)

, . i- pi ( 2 1). , , p1 = 2, p2 = 3, p3 = 5, p52 = 239.

, pi , i = pk k. -, , , - , .

k. . - k- .

INPUT.TXT k (1 k 500).

OUTPUT.TXT k- . INPUT.TXT OUTPUT.TXT

1 1 3

2 2 5

3 3 11

4 100 3911

061. (: 1 . : 16 : 5%)

4 . - .

INPUT.TXT 4 , a b . , b (0 a, b 100).

OUTPUT.TXT , - DRAW. INPUT.TXT OUTPUT.TXT

1

26 17

13 15

19 11

14 16

1

2

14 15

17 18

20 20

15 17

2

3

15 16

18 17

10 12

14 12

DRAW

54

062. (: 1 . : 16 : 15%)

, 88 2 , , (. ). , - . - A H, 1 8. , 1 . .

INPUT.TXT - : ( ).

OUTPUT.TXT WHITE, BLACK, . INPUT.TXT OUTPUT.TXT

1 C3 BLACK

2 G8 WHITE

063. (: 1 . : 16 : 18%)

. , . . X Y (X, Y1000), . . S - P. .

INPUT.TXT S P, .

OUTPUT.TXT Y, . , . INPUT.TXT OUTPUT.TXT 1 4 4 2 2

2 5 6 2 3

, :

X+Y=S X*Y=P

-, , Y. -. , . X Y (, ). , - XY. , , -. : read(s,p);

for x=1..1000{

for y=x..1000{

if(x+y==s x*y==p) write(x,' ',y);

}

}

55

. , - , - . , Y 30000, , .. , 1 . . , X , Y, .. Y=S-X. : read(s,p);

for x=1..30000{

y=s-x;

if(x

56

INPUT.TXT s .

n , . n mi . (|s| = |m1| = |m2| = ... = |mn|). 0 1. 60 .

OUTPUT.TXT k , . - k . INPUT.TXT OUTPUT.TXT

1

010101

3

110011

011001

000111

2

2 3

066. (: 1 . : 16 : 11%)

- . , .. p a, l z, m q.

INPUT.TXT .


1 q w

2 t y

3 p a

4 l z

5 m q

067. (: 1 . : 16 : 33%)

TCP/IP . - . N . . 4 , . : - , k , q , k + q = 32. , 255.255.255.0 , 192.168.0.1 .

, IP-. , - IP-, ( 8 ), . - 32- IP-. , 192.168.0.1 : 192.168.0.1 11000000.10101000.00000000.00000001 11000000101010000000000000000001. , IP- 192.168.0.1 11000000101010000000000000000001.

57

, IP1 IP2 , IP1 /\ Mask = IP2 /\ Mask, Mask , /\ - . IP 4 , .

M IP . , .

INPUT.TXT N -. N . N + 2 M (0 M 10000). M IP , - .

IP OUTPUT.TXT - , . INPUT.TXT OUTPUT.TXT

1

2

255.255.255.255

255.255.255.0

3

192.168.31.1 192.168.31.2

192.168.31.3 192.168.31.4

192.168.31.1 192.167.31.2

1

1

0

068. - - (: 1 . : 16 : 21%)

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

, , , - , . : , , , , .

.

INPUT.TXT 2 . School Home , X -. X, 1 X 1000.

OUTPUT.TXT Yes, , - No . INPUT.TXT OUTPUT.TXT

1 Home

1

Yes

2 School

2

No

58

069. N- (: 1 . : 16 : 28%)

N- - N-. , , - . , .

N A N- . : - .

INPUT.TXT : N A (3 N 1000, 1 A 1000).

OUTPUT.TXT YES, NO . INPUT.TXT OUTPUT.TXT

1 3 1 YES

2 239 566 NO

070. (: 1 . : 16 : 30%)

s = s1s2...sn. k- (k > 0) sk sk = s1s2 . .

.sns1s2 . . .sn......s1s2...sn (k ). , abc bbb.

k s t ( ), tk = s. , ,

.

INPUT.TXT s, - , 1000.

k 0, |k| < 100001. k > 0, - k- s, k < 0, |k| s.

OUTPUT.TXT , . - 1023 , 1023 . - NO SOLUTION. INPUT.TXT OUTPUT.TXT

1 Abc

3

abcabcabc

2 Abcdabcd

-2

abcd

3 Abcd

-4

NO SOLUTION

071. (: 1 . : 16 : 43%)

N W1, W2 , WN. 2 , .

59

INPUT.TXT N

(1 N 18). W1, W2 , WN (1 Wi 10

5).


1 5

5 8 13 27 14

3

072. (: 1 . : 16 : 45%)

, 80 (, WORD). , - (, RDOW, WODR ..). , .

INPUT.TXT , .


1 abdc acbd

2 word wrdo

073. (: 1 . : 16 : 28%)

. , . -. : a 1, b 2, , z 26, 27. - 27, 27 (0, 1, , Q ).

.

INPUT.TXT -, 255 . .


1 L7MO test

2 576J9FLF decoding

60

074. (: 1 . : 16 : 38%)

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

, - , .

INPUT.TXT -: N M. - (1 M, N 109).

OUTPUT.TXT M . , N. INPUT.TXT OUTPUT.TXT

1 4 2 1

2 4 1 4

3 9 5 7

075. (: 1 . : 16 : 65%)

N- . , 0, . N=3 :

S = 1*0*0 + 1*0*1 + 1*0*2 + + 9*9*8 + 9*9*9 = 91125.

INPUT.TXT - N (N < 1000).

OUTPUT.TXT N- . INPUT.TXT OUTPUT.TXT

1 1 45

2 3 91125

3 5 184528125

076. (: 1 . : 16 : 59%)

. , N , - . - , .

INPUT.TXT N (N < 105) . , N : - : : (00:00 : 23:59).

61

OUTPUT.TXT

, . INPUT.TXT OUTPUT.TXT

1

6

09:00 10:07

10:20 11:35

12:00 17:00

11:00 11:30

11:20 12:30

11:30 18:15

4

077. (: 1 . : 16 : 63%)

N K 1 N, K .

, N=8 K=1, 1 8 - : 1, 10, 11, 100, 101, 110, 111 1000.

, 10, 101 110 , .. - 3.

INPUT.TXT N K, 109.

OUTPUT.TXT 1 N K . INPUT.TXT OUTPUT.TXT

1 8 1 3

2 13 2 4

3 1000 5 210

078. (: 1 . : 16 : 48%)

Sprite 0.25 ., .

, Sprite, .

. , , . .

, , - .

INPUT.TXT , F ( Sprite) P ( Sprite), .

: 1 P < F 109, 2*109.

OUTPUT.TXT , .

62


1 7 3 83

079. A^B (: 1 . : 16 : 21%)

, , - A^B.

INPUT.TXT , A B, (1 A, B 10000).

OUTPUT.TXT , - A^B. INPUT.TXT OUTPUT.TXT

1 2 2 4

2 3 7 7

3 24 9 4

080. (: 1 . : 16 : 26%)

, -. , 2+3=5 , 23*7=421 , . : , (+, -, *, /), , , . .. . , 2*=3, 173 2+2=a -.

INPUT.TXT , - . 30000. 100 .

OUTPUT.TXT YES, - (.. ), NO , ERROR, . INPUT.TXT OUTPUT.TXT

1 2+3=5 YES

2 3*7=20 NO

3 two plus three is five ERROR

081. (: 1 . : 16 : 14%)

: , . , , . : - ? !

63

INPUT.TXT N .

N , . - . 30000.

OUTPUT.TXT : , , . INPUT.TXT OUTPUT.TXT

1 5

5 1 6 5 9

1 9

n

, . - max, , 0 ( , .. ). - x : , - max. , max. , max . -. , .

: read(n);

max=0; min=32000;

for i=1..n{

read(x);

if(x>max) max=x;

if(x

64

. , ,

, - , : , . O(n2), TLE (Time limit exceeded).

. , . a[i] i=0..105, i- 0, i . i -, 1, , 2. i, a[i]=2. a[i] : , x - a[x]=1. y a[y]=2 , a[y]=1.

: int a[0..105]={0...0};

read(n,m);

for i=1..n{

read(x);

a[x]=1;

}

for i=1..m{

read(y);

if(a[y]==1) a[y]=2;

}

for i=1..105{

if(a[i]==2) write(i,' ');

}

083. (: 1 . : 16 : 66%)

BrokenTiles , 1x1 . -, - MxN .

: -, , , , , , -, -, . , - , 2x2 , - . 1 -, 2 .

,

, . ! INPUT.TXT -

, M N (1 MN 30).

65

OUTPUT.TXT

, MxN. , - , . INPUT.TXT OUTPUT.TXT

1 2 2 14

2 3 3 322

084. (: 1 . : 16 : 27%)

. - . , , .

, , A [AB] .

INPUT.TXT N M (1 N, M 100) , . N * .. * , . .

OUTPUT.TXT , - , N M * . . INPUT.TXT OUTPUT.TXT

1 2 4

..*.

.**.

.**.

.**.

2

4 3

.*.

.*.

.*.

.*.

.*.

.*.

.*.

.*.

085. (: 1 . : 16 : 23%)

, . N , M. .

, ( ) a b - c, b c a c.

INPUT.TXT N M (1 N, M 2000).


1 1 1 1

2 1 2 1

66

086. (: 1 . : 16 : 15%)

, . , , .

- -, 88 , . 33, .. , .

NxN.

INPUT.TXT N NxN (1 N 100).

OUTPUT.TXT , NxN , . INPUT.TXT OUTPUT.TXT

1 3 2

087. - 2 (: 1 . : 16 : 32%)

S = {s1, s2, s3, ... , sn}. si S, sj sk S (si = sjsk, j k ).

INPUT.TXT S . i- si. ENDOFINPUT. S.

si 100 . 239 .


1

a

ab

abaa

ENDOFINPUT

2

2

abc

bcd

def

ENDOFINPUT

0

088. (: 1 . : 16 : 27%)

n n2, n2 - n, n2 . - 1 n2.

67

, , - 1 n2.

n. - .

INPUT.TXT n (1 n 10). - n2 n2 , .

100 .

, OUTPUT.TXT Correct, Incorrect. INPUT.TXT OUTPUT.TXT

1

3

1 3 2 5 4 6 9 8 7

4 6 5 8 7 9 3 2 1

7 9 8 2 1 3 6 5 4

9 2 1 4 3 5 8 7 6

3 5 4 7 6 8 2 1 9

6 8 7 1 9 2 5 4 3

5 7 6 9 8 1 4 3 2

2 4 3 6 5 7 1 9 8

8 1 9 3 2 4 7 6 5

Correct

2 1

10

Incorrect

, : -

k , 1 k ( k=n2). , : . , , , , . d[1..k] ( 100 , n), -. x d[x]=1, x -. d 1 k: 1 , , .

, - , n x n. - , , , : for i=1..n{

for j=1..n{

d[1..100]={0..0};

for y=(i-1)*n+1 .. i*n{

for x=(j-1)*n+1 .. j*n{

d[a[y][x]]=1;

}

}

Check(d);

}

}

68

089. (: 1 . : 16 : 25%)

- n . - .

, - 650 .

INPUT.TXT n (1 n 100). - n .

, . 50 , . , , , () - (_). :. - .

- 24 .

, .

OUTPUT.TXT -. . -, . INPUT.TXT OUTPUT.TXT

1

3

"ER-200" 06:43 10:40

"Red Arrow" 23:55 07:55

"Express" 23:59 08:00

The fastest train is "ER-200".

It's speed is 165 km/h, approximately.

2

3

"Train1" 00:00 00:00

"Train2" 00:00 00:01

"Train3" 00:01 00:01

The fastest train is "Train2".


3

2

"Slow Train 1" 10:00

09:59

"Slow Train 2" 10:00

10:00

The fastest train is "Slow Train 1".


090. (: 1 . : 16 : 37%)

. N, xn,yn. , , .

, N. , .

: xn yn N. - k (1 k 1000). - k . x1, y1, x2, y2, x3, y3, (x1, y1), (x2, y2), (x3, y3) .

, . - 10000 .

69

,

N. -. , . INPUT.TXT OUTPUT.TXT

1

0 1

2

-2 0 2 0 0 2

-3 0 3 0 0 3

2

1 2

2

0 2

2

-2 0 2 0 0 2

-3 0 3 0 0 3

1

2

091. (: 1 . : 16 : 29%)

an bn : a1 = 2, a2 = 3, a3 = 4, a4 = 7, an = bn1 + bn3, n > 4, bn , an, - .

, an : 2, 3, 4, 7, 13, 15,..., bn 1, 5, 6, 8, 9, 10,....

, an bn.

n (1 n 10000).

an, bn. INPUT.TXT OUTPUT.TXT

1 4 7

8

2 10 25

16

3 6578 19731

9868

092. (: 1 . : 16 : 7%)

, . S . , , - , , ?

INPUT.TXT S (S < 106).

OUTPUT.TXT , - , (, ).

70


1 6 1 4 1

2 24 4 16 4

3 60 10 40 10

4-

. x , , 4x , S, x+x+4x=S, x=S/6. 2*S/3 .

. , S -, 4- . - DOS. int (integer) 2 . , , S 6, , ...

093. (: 1 . : 16 : 26%)

- . , - - .. - - . , . - . !

INPUT.TXT N . N . , M - , . M - . K (1 N, M, K 30).

OUTPUT.TXT N - , . INPUT.TXT OUTPUT.TXT

1

3

ZEUS

POSEIDON

AFINA

4

ZEVS

POSEYDON

AVYNA

ZERS

2 1 0

094. (: 1 . : 16 : 22%)

, . - , . , . , ;

71

; , . , , . , , - . , , , .

INPUT.TXT N , - . M . K , (1 N, M, K 105). - .

OUTPUT.TXT , , , . , NO. INPUT.TXT OUTPUT.TXT

1 3 6 2 4

2 4 4 5 1

3 5 10 6 NO

095. (: 1 . : 16 : 24%)

, , . , , . , - . , , , - . , .

INPUT.TXT N (1 N 10100).

OUTPUT.TXT : N . INPUT.TXT OUTPUT.TXT

1 1 1 0

2 10 1 1

3 99 9 2

096. - (: 1 . : 16 : 41%)

- N*M -. . . . , 90 - . -, , .

72

INPUT.TXT N M (0 < N, M 100)

, Y X (0 < Y N, 0 < X M) , - .


1 1 1

1 1

1

2 3 3

2 3

4

3 5 5

2 3

18

097. (: 1 . : 16 : 60%)

N , . - . - Ri , , . , - . - , - () .

, .

INPUT.TXT N (1 N 100) - . N x1, y1, x2, y2, R. (x1, y1) (x2, y2) (-104 x1, y1, x2, y2 10

4). . , , . R (0 R 104) , - .


1 3 1 6 4 1

1 -2 2 -3 1

-2 -2 -1 -3 2

2

098. (: 1 . : 16 : 28%)

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

73

, . . , . , - . , -. . , .

, , - .

INPUT.TXT N - (1 N 104). N - [1, 32000], .

OUTPUT.TXT , . , , . INPUT.TXT OUTPUT.TXT

1 5

4 4 1 5 4

9:9

2 1

1234

1234:0

099. (: 1 . : 16 : 57%)

, , . h , -. , m n -. , , .

, ( - ). 5 .

. - , .

INPUT.TXT h, m n (2 h, m, n 50). - h , . - m , n : . , , 1 , , 2 , . 1 2 : - 1 , 2 . .

OUTPUT.TXT , - , . , -, .

74


1

3 3 3

1..

oo.

...

Ooo

..o

.oo

Ooo

o..

o.2

60

100. (: 1 . : 16 : 86%)

N - . , - , . , 564159 , .. 5+6+4=1+5+9.

INPUT.TXT - N (N 100) .


1 4 670

2 6 55252

3 12 39581170420

101. (: 1 . : 16 : 70%)

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

N N K , .

INPUT.TXT : N K (1 < K N 10).


1 3 1 9

2 4 2 20

3 5 3 48

75

102. (: 1 . : 16 : 32%)

- . , , .

INPUT.TXT - . (x1, y1), (x2, y2), (3, 3), (x4, 4). 10000 .

OUTPUT.TXT In, Out . INPUT.TXT OUTPUT.TXT

1

0 0

100 0

0 100

100 100

Out

2

0 0

100 0

0 100

10 10

In

3

0 0

100 0

0 100

50 50

In

4

0 0

100 0

0 100

0 0

In

103. A+B (: 1 . : 16 : 35%)

.

INPUT.TXT - , 10100.


1 2 3 5

,

. a b, , a. .

-:

76

const maxsize=101;

int a[maxsize], b[maxsize];

readlong(a);

readlong(b);

m=max(a[0],b[0]);

c=0;

for i=1..m{

c = c+a[i]+b[i];

a[i] = c mod 10;

c = c div 10;

}

a[0]=m;

if(c>0){

m=m+1;

a[m] = c;

}

writelong(a);

104. (: 1 . : 16 : 65%)

, ? *. , , - ? , * (, ) , , - . , , .

INPUT.TXT : , ? *, , . - 255 .

OUTPUT.TXT YES, - NO . INPUT.TXT OUTPUT.TXT

1 ABBCDA

A*CDA

YES

105. (: 1 . : 16 : 76%)

- . , . , , - , ( : -5 0-5). , , ( ) : , 3+3*5 30, 18. , - . , 18=7 (5 3) 2, - 18=7+(5-3)*2. , - , .

77

INPUT.TXT , -

230, , ( ), - 230. ( ) . 80 , - . , - , , ( 0) (, ).

OUTPUT.TXT , - (.., - ). , - , -1. . INPUT.TXT OUTPUT.TXT

1 18=7 (5 3) 2 18=7+(5-3)*2

2 5= 3 3 -1

106. (: 1 . : 16 : 8%)

n . , -. , , - .

INPUT.TXT N (1 N 100) . N : 1, - 0, .


1

5

1

0

1

1

0

2

, ,

. . - , .. n - , i- - .

78

: read(n);

s0=s1=0;

for i=1..n {

read(x);

if(x==0) s0++; else s1++;

}

write(min(s0,s1));

107. (: 1 . : 16 : 62%)

, , , , . , ? , , , ? , 872-73-33, , : 8727-333.

. 2 4 . , - . , .

aa 2

aba 2

aab, abb 2

aaa 3

abac, baca 2

abab 3

aabb 3

abba 4

baaa, abaa, aaba, aaab 3

aaaa 5

, b, . , aab 223, 667, 123 888. , .

INPUT.TXT 7 .

OUTPUT.TXT - , . , .


1 8727333 8727-333

5

2 8827291 88-272-91

4

108. (: 1 . : 16 : 1%)

, , . -: , , ,

79

. , - . Fi(x) , - x , i+1 i. n- y, :

y = Fn-1(Fn-2(F2(F1(x)))). - ,

, , .. Fi(x) = x i 1 n-1.

INPUT.TXT 1 100.


1 5 5

,

.. . , , , . : , - , , . , input.txt output.txt . - ? ( :) 1 , input.txt, ...)

, , , - . , , -, . !

109. A / B (: 1 . : 16 : 43%)

/ A B.

INPUT.TXT - , 1000. / .

OUTPUT.TXT A/B -, . - .

, : 08.92, 3.20, 120.6(6), 0.(33), 5.(0), 2. , .3, 0.33(03) . 8.92, 3.2, 120.(6), 0.(3), 5, 2, 0.3, 0.3(30) . INPUT.TXT OUTPUT.TXT

1 10/7 1.(428571)

2 1/3 0.(3)

3 100/25 4

80

110. (: 1 . : 16 : 78%)

, , 0 k (1 k 9). , k = 2, 2, 20, 22, 2002 .. , -. , k = 3, 69 : 69 = 33 + 30 + 3 + 3.

. , k = 5 6 . - , : 6 = 5.5 + 0.5.

. , k = 3, 43 : 43 = 33.(3) + 3.(3) + 3 + 3.(3).

, - . , 69 - 69 = 33 + 33 + 3. , n .

, n k n .

INPUT.TXT n k (1 n 109, 1 k 9).

OUTPUT.TXT n , 0 k, . - : n=a1+a2+...+am. a1, a2, ..., am , . - , .

, : 07.7; 2.20; 55.5(5); 0.(66); 7.(0); 7. ; .5; 0.33(03). : 7.7; 2.2; 55.(5); 0.(6); 7; 7; 0.5; 0.3(30). - 100 . , . -. . INPUT.TXT OUTPUT.TXT

1 69 3 69=3+33+33

2 6 5 6=0.5+5.5

3 10 9 10=9.(9)

111. (: 1 . : 16 : 28%)

. K . - , 1 L . , .

, , - K. , , , , L.

, .

INPUT.TXT K (1 K 108) - .

81

OUTPUT.TXT L (2 L < K) -

, , . , . , 0. INPUT.TXT OUTPUT.TXT

1 3 2

2 26 12

3 31 30

112. (: 1 . : 16 : 58%)

, . K N , , , - . , , . - (), : , .

, , - . : ?

!

INPUT.TXT N K (2 N 104, 1 K 20) . K N 1 N . ( ), , ..


1

3 3

1 2 3

2 1 3

3 2 1

4

2 5 2

1 5 2 4 3

2 3 1 5 4

7

113. (: 1 . : 16 : 46%)

, .. , . , , , . NxN , .

.

82

INPUT.TXT -

N (1 N 1000) . , N , ( ) , - .


1

7

1101101

1111110

1011100

0011100

1000010

1100111

1001110

9

114. (: 1 . : 16 : 37%)

N- K, , .

INPUT.TXT N K (2 K 10; 2 N; 4 N+K 18).


1 2 10 90

2 4 2 5

3 6 3 328

115. (: 1 . : 16 : 42%)

MxN. - , .

INPUT.TXT N M (1 N, M 100) . N M , , , - 100 .

OUTPUT.TXT .

83


1 2 3

5 0 9

1 2 7

24

2

4 5

-7 8 -1 0 -2

2 -9 2 4 -6

-7 0 6 8 1

4 -8 -1 0 -6

20

116. - 2 (: 1 . : 16 : 60%)

, . , . - MxN. . .

.

INPUT.TXT N M (1 N,M 1000) . , N , - ( ) M , . .

OUTPUT.TXT - , . INPUT.TXT OUTPUT.TXT

1

5 10

1011011111

0111111110

1111111111

1011111111

1101110111

21

117. (: 1 . : 16 : 57%)

- , .

, .

- , .

INPUT.TXT - N . N - Xi Yi , . .

84

, 1000 . OUTPUT.TXT -

, . INPUT.TXT OUTPUT.TXT

1

10

4 6

2 5

6 4

7 7

4 4

1 5

3 8

3 2

5 7

7 3

26

118. (: 1 . : 16 : 19%)

, . - 41 . - , , . , .

, N , 1 N, k- , .

, N=10, K=3, 3-, 6-, 9-, 2-, - 7-, 1-, 8-, 5-, 10-. , 4-.

, N K .

INPUT.TXT N K. : N 500, K 100.


1 10 3 4

119. (: 1 . : 16 : 13%)

, , .

INPUT.TXT N (1 N 100), - N N . 3 ( 0 23), ( 0 59) ( 0 59).

85

OUTPUT.TXT ,


1

4

10 20 30

7 30 00

23 59 59

13 30 30

7 30 0

10 20 30

13 30 30

23 59 59

. ,

. , - , , . : x = 3600*h + 60*m + s

h = x div 3600

m = (x div 60) mod 60

s = x mod 60

, , .. - 100. 4- , .. 86400 .

120. (: 1 . : 16 : 32%)

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

.., .

INPUT.TXT N M (1 N 20, 1 M 20). N M .. - ( 0 100).


1

3 4

1 1 1 1

5 2 2 100

9 4 2 1

8

121. (: 1 . : 16 : 34%)

. . , , .

86

INPUT.TXT N

(1 N 100). N (- , 10000).


1 5

4 10 0 12 2

6

122. (: 1 . : 16 : 38%)

, .

INPUT.TXT N - (1 N 1000). ( ). , 10000 .


1 6

3 29 5 5 28 6

3

123. (: 1 . : 16 : 54%)

, . , , - .

INPUT.TXT 80 .

OUTPUT.TXT . , 2*109. INPUT.TXT OUTPUT.TXT

1 ????(? 2

124. (: 1 . : 16 : 25%)

M N , - . - . , , . 1 N.

87

INPUT.TXT N M (0 < N 100, 0 M N*(N-1)/2).

M i j (1 i, j N), , - i j . , . i .

OUTPUT.TXT N : k- - k- . INPUT.TXT OUTPUT.TXT

1

7 10

5 1

3 2

7 1

5 2

7 4

6 5

6 4

7 5

2 1

5 3

3 3 2 2 5 2 3

125. (: 1 . : 16 : 26%)

, . , -. , . , , , . , , , . , , . .

INPUT.TXT N (0 < N 100) . , (1 , 0 ). , N , : 1 ; 2 ; 3 .


1

7

0 1 0 0 0 1 1

1 0 1 0 0 0 0

0 1 0 0 1 1 0

0 0 0 0 0 0 0

0 0 1 0 0 1 0

1 0 1 0 1 0 0

1 0 0 0 0 0 0

1 1 1 1 1 3 3

4

88

126. (: 1 . : 16 : 28%)

, , . , . - . ! . ! .

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

, , , -, , . , , - . , .

INPUT.TXT N (3 N 100), NxN ( i, j , - i- j- ). ( ) , 1000. -, 0.


1

5

0 20 10 30 40

20 0 30 1 2

10 30 0 40 1000

30 1 40 0 21

40 2 1000 21 0

24

127. (: 1 . : 16 : 40%)

.

INPUT.TXT N (1 N 100). (0 , 1 - ). .

OUTPUT.TXT . -, 1. INPUT.TXT OUTPUT.TXT

1

5

0 1 0 0 1

1 0 1 0 0

0 1 0 0 0

0 0 0 0 0

1 0 0 0 0

3 5

3

89

128. (: 1 . : 16 : 43%)

NxN (x1, y1) . (x2, y2), . ?

INPUT.TXT : N, x1, y1, x2, y2 (5 N 20, 1 x1, y1, x2, y2 N). (1, 1), - (N, N).


1 5

1 1

3 1

2

129. (: 1 . : 16 : 40%)

, N M . - 0, 1. (x1, y1) (x2, y2) |x1-x2|+|y1-y2|. , - , 1 ( ). , 1 .

INPUT.TXT , 100 - N M. N M .

OUTPUT.TXT N M - . INPUT.TXT OUTPUT.TXT

1 2 3

0 0 1

1 0 0

1 1 0

0 1 1

130. (: 1 . : 16 : 55%)

(88) 2 : . , , : . . . , -: , , , - . , ?

INPUT.TXT , (.. ( a h) ( 1 8), ).

OUTPUT.TXT , 1, . INPUT.TXT OUTPUT.TXT

1 a1 a3 1

90

131. (: 1 . : 16 : 15%)

N . , . .

INPUT.TXT N - (N100). N -: : V S (1 V 100, S - 0 1). S=1, S=0.

OUTPUT.TXT . , . - , -1. INPUT.TXT OUTPUT.TXT

1

4

25 1

70 1

100 0

3 1

2

132. (: 1 . : 16 : 47%)

. S F.

INPUT.TXT : N, S F (1 N 100; 1 S, F N), N . N N - , i- j- i j: -1 , - . .

OUTPUT.TXT -1, . INPUT.TXT OUTPUT.TXT

1

3 1 2

0 -1 2

3 0 -1

-1 4 0

6

133. (: 1 . : 16 : 49%)

N , . , . . N-, .

INPUT.TXT N (1 N 100), N , i- i- ( 0 100). M , -

91

. , . ( , ); ; , - .

OUTPUT.TXT - -1, . INPUT.TXT OUTPUT.TXT

1

4

1 10 2 15

4

1 2

1 3

4 2

4 3

3

: 1- 3-, 4-. -

1 3 .

134. (: 1 . : 16 : 50%)

. - , .

d v (, 0 d).

INPUT.TXT N (1 N 100), d v, R (0 R 10000). . , - , ( 0 10000). t , , t.

OUTPUT.TXT , v. d v, -1. INPUT.TXT OUTPUT.TXT

1

3

1 3

4

1 0 2 5

1 1 2 3

2 3 3 5

1 1 3 10

5

135. (: 1 . : 16 : 36%)

. . , .

92

INPUT.TXT -

N (1 N 100) . N N (j- i- i - j). 100. .

OUTPUT.TXT N N . j- i- - i j. INPUT.TXT OUTPUT.TXT

1

4

0 5 9 100

100 0 2 8

100 100 0 7

4 100 100 0

0 5 7 13

12 0 2 8

11 16 0 7

4 9 11 0

136. - 2 (: 1 . : 16 : 39%)

. , - .

INPUT.TXT - N (1 N 100) . N N , -1 , - . .


1

4

0 5 9 -1

-1 0 2 8

-1 -1 0 7

4 -1 -1 0

16

137. (: 1 . : 16 : 65%)

. : .

: , .

INPUT.TXT - N (1 N 100) . N N (j- i- i - j), 0 , . 100.

93

OUTPUT.TXT N N : j- i-

0, i j , 1 , 2 . INPUT.TXT OUTPUT.TXT

1

5

0 1 2 0 0

1 0 3 0 0

2 3 0 0 0

0 0 0 0 -1

0 0 0 -1 0

1 1 1 0 0

1 1 1 0 0

1 1 1 0 0

0 0 0 2 2

0 0 0 2 2

138. - (: 1 . : 16 : 38%)

, . - , (, ). , .

1 .

INPUT.TXT N (1 N 100) , M (0 M 10000) . M -, : , ( -100 100).

OUTPUT.TXT N 1 . , 30000. INPUT.TXT OUTPUT.TXT

1

4 5

1 2 10

2 3 10

1 3 100

3 1 -10

2 3 1

0 10 11 30000

139. (: 1 . : 16 : 45%)

. N , 1 N, . , , . 1, - N. ( - ). .

INPUT.TXT N (1 N 2000) M (1 M 10000) . M , ( ), ,

94

( 10000). , .

OUTPUT.TXT : ":)" , ":(" , - . INPUT.TXT OUTPUT.TXT

1 2 2

1 2 5

1 2 -5

5

140. (: 1 . : 16 : 46%)

. , .

INPUT.TXT N (1 N 100) - . N N . 10000. , - 100000.

OUTPUT.TXT YES, , NO . INPUT.TXT OUTPUT.TXT

1 2

0 -1

-1 0

YES

141. (: 1 . : 16 : 42%)

. - , .

INPUT.TXT N ( 1 100). N*N, 1 - , 0 . .

OUTPUT.TXT YES, -, NO . INPUT.TXT OUTPUT.TXT

1

3

0 1 0

1 0 1

0 1 0

YES

142. (: 1 . : 16 : 53%)

- .

95

INPUT.TXT N M (1 N 100;

1 M 6000), N , M . - M A, B, C, A B , - , C ( , 30000).


1

3 3

1 2 1

2 3 2

3 1 3

3

143. A-B (: 1 . : 16 : 44%)

.

INPUT.TXT A B, 101000.

OUTPUT.TXT A-B. INPUT.TXT OUTPUT.TXT

1 7

5

2

2 5

17

-12

,

. A-B=-(B-A), A < B "-", (B-A). c . a, .. - .

: const maxsize=1001;

int a[maxsize], b[maxsize];

readlong(a);

readlong(b);

if(complong(a,b) < 0){

write('-');

a b;

}

c=0;

for i=1..a[0]{

c = c+a[i]-b[i]+10;

a[i] = c mod 10;

if(c < 10) c=-1; else c=0;

}

while(a[a[0]]=0 and a[0]>1) a[0]=a[0]-1;

writelong(a);

96

144. A*B (: 1 . : 16 : 37%)

A B. .

INPUT.TXT A B - (A < 10100, B 10000).

OUTPUT.TXT - - A*B. INPUT.TXT OUTPUT.TXT

1 5

7

35

. -

, (.. ), B , B . - a, c.

: const maxsize=105;

int a[maxsize], b, c=0;

readlong(a);

read(b);

for i=1..a[0]{

a[i] = a[i]*b+c;

c = a[i] div 10;

a[i] = a[i] mod 10;

}

while(c>0){

a[0] = a[0]+1;

a[a[0]] = c mod 10;

c = c div 10;

}

writelong(a);

145. A div B (: 1 . : 16 : 40%)

A B. .

INPUT.TXT A B (A < 10100, B 10000).

OUTPUT.TXT - - A div B. INPUT.TXT OUTPUT.TXT

1 7 3 2

.

, . - , , -

97

. - (x mod b)*10+r, x- , b , r . .

, , : const maxsize=101;

int a[maxsize], b;

readlong(a);

read(b);

x=0; k=0;

for i=a[0]..1{

x = x*10+a[i];

if(x < b and k=0 and i > 1) continue;

k=1;

write(x div b);

x = x mod b;

}

146. (: 1 . : 16 : 67%)

, B2 A.

INPUT.TXT A (A 103000).

OUTPUT.TXT B, A. B . INPUT.TXT OUTPUT.TXT

1 17 4

. , K-

2*K-1, 2*K . , K- , .. 10K-1, 102K-2, .. 2*K-1 ; K- , .. 10K-1, 102K-2*10K+1, .. 2*K . y=x2 - x>0(.. x1,x2 > 0, x1 < x2 x1

2 < x22),

K- 2*K-1, 2*K . , A N , (N+1) div 2 .

, , , . K . K+1 - 9, , - (, , K+2 0) A . , - K+1 . , .

. - . , - , 10, . , - , 10.

98

aK , K- , b , - 10 . aK+1

2=(aK+b)2=aK

2+2aKb+b2.

, , - , . .

http://olympiads.ru.

147. (: 1 . : 16 : 16%)

a0, a1, ..., an, ..., a0 = 0, a1 = 1, ak = ak-1 + ak-2 (k > 1).

N- .

INPUT.TXT N (0 N 30).


1 7 13

. -

: int a=0,b=1,c;

read(n);

for i=2..n{

c=a+b;

a=b;

b=c;

}

if(i

99

, : (a,b)=(a, a mod b) (d,0), d . , a b - , - .

- : read(a,b);

while a*b > 0 do

if a >= b then a = a mod b else b = b mod a;

write(a+b);

( ) ++ : #include

#include

int a,b;

int main(){



cin>>a>>b;

while(b) b^=a^=b^=a%=b;

cout

100

, , , . , .

150. (: 1 . : 16 : 41%)

N . . , - . , .

INPUT.TXT : N S (1 N 100; 1 S N), N , S . - N N , . , i- j- , i j , 0 .

OUTPUT.TXT - S, . INPUT.TXT OUTPUT.TXT

1

3 1

0 1 0

1 0 1

0 1 0

2

151. (: 1 . : 16 : 54%)

N (). 2 . , . - , - . , .

INPUT.TXT : N M (1 N, M 100), N , M , -. M 2 , .

, OUTPUT.TXT YES NO . INPUT.TXT OUTPUT.TXT

1 3 2

1 2

1 3

YES

152. (: 1 . : 16 : 62%)

- N666. - , .

101

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

, ( , , ) . , , , .

INPUT.TXT N M (1 N 100, 1 M 5000) - , , . A B (1 A, B N), , , , A , B.

OUTPUT.TXT Yes , No . INPUT.TXT OUTPUT.TXT

1

5 4

1 3

1 4

4 3

5 2

Yes

153. - 2 (: 1 . : 16 : 51%)

A1, A2,..., AM. , . N. , , .

INPUT.TXT N (1 N 109), - M (1 M 15) M A1, A2, ..., AM (1 Ai 109).

OUTPUT.TXT , , . - , , - . , 0. , , -1 ( ). INPUT.TXT OUTPUT.TXT

1 5 2

1 2

3

2 7 2

1 2

-1

3 5 2

3 4

0

102

154. (: 1 . : 16 : 52%)

, . , . .

, , , - . 239, , . - , , , - , - , .

, , , , - . INPUT.TXT N (1 N 2*109).

OUTPUT.TXT

, N. , , . , IMPOSSIBLE. INPUT.TXT OUTPUT.TXT

1 17 2 2 1

2 239 IMPOSSIBLE

155. (: 1 . : 16 : 59%)

. - C . n , - C1, C2, ... ,Cn . , - (Cnew = C1 + C2) - (Cnew = (C1*C2)/(C1+C2) ). -- , , - ( ). , .

- . , , - . , - - , -, , -- , -.

INPUT.TXT n C. C1, C2, ..., Cn. . n < 7.

OUTPUT.TXT YES, - , 0.01 C. INPUT.TXT OUTPUT.TXT

1 3 1.66

1 2 1

YES

103

,

. 1.(6)

156. - 2 (: 1 . : 16 : 46%)

NxN K , - . .

INPUT.TXT N K (N, K 8).


1 8 8 40320

157. (: 1 . : 16 : 48%)

. . , , , : , ?.

.

INPUT.TXT , - 15 .


1 solo 12

158. (: 1 . : 16 : 60%)

- K X . , , ...

, .. . , . K - . ...

: K .

INPUT.TXT X (0 X 500) K (0 K 100). , X 5. .

OUTPUT.TXT - . INPUT.TXT OUTPUT.TXT 1 15 2 10

104

159. (: 1 . : 16 : 25%)

. N N -

1 N. N PN = N! N . -

. , , i ai - , ai - i- .

-1, -1 = -1 = , .

INPUT.TXT 0 < N 20000 - . .


1 3

2 3 1

3 1 2

160. (: 1 . : 16 : 46%)

. N N -

1 N. N PN = N! N . -

. , , i ai - , ai - i- .

-1, -1 = -1 = , .

k , k = .

INPUT.TXT 0 < N 100 - -. .

OUTPUT.TXT . -, 109. INPUT.TXT OUTPUT.TXT

1 3

2 3 1

3

Скачать PDF-файл (3 Мб).

Documents

Transcript of Скачать PDF-файл (3 Мб).