By RAD, 12 years ago, translation,

Attention, participants from the Division 1! As a test feature, you can participate in Codeforces Beta Round #32 "out of competition".

Everybody knows, that the 2nd of October - birthday of Mohandas Gandhi. We dedicate today's round to him, and many other great people who were born on October 2 :)

Round was prepared by Mike Mirzayanov, Matov Dmitry and Max Ivanov.

Special thanks to Julia Satushina for translation of statements.

Good luck!

Artem Rakhov and Codeforces team

UPD:

• +14

 12 years ago, # |   0 Will all the following contests be codeforces format?
 12 years ago, # |   0 Please hold future contests in a more suitable time. What should we students do?
12 years ago, # |
+22

# i sacrificed my class only for codeforces  contest :(

•  12 years ago, # ^ |   -6 :D it worth it!
•  12 years ago, # ^ |   +9 They should make a T-shirt with this print.
•  12 years ago, # ^ |   -6 +2 really great idea :D
•  12 years ago, # ^ |   0 ya.. :)
•  12 years ago, # ^ |   0 haha~~ it's holiday time in China.
•  12 years ago, # ^ |   0 so crazy!!!
•  12 years ago, # ^ |   0 :D yep
 12 years ago, # |   0 problem C's test 5 is?and the answer.thanks~
•  12 years ago, # ^ |   0 9 8 7
•  12 years ago, # ^ |   0 my result is 4.the correct one is?
•  12 years ago, # ^ |   0 No. The correct one is 8.
 12 years ago, # |   0 Cuse the long but not int in Java, longlong but not int in C++Dthree FOR loop is a good solution
•  12 years ago, # ^ |   0 Cprintf("I64d\n",ans);not printf("lld\n",ans);
 12 years ago, # |   0 What is test 10 for problem C?
•  12 years ago, # ^ |   0 1000000 1000000 1Answer is 1000000000000
•  12 years ago, # ^ |   +8 Спасибо!
 12 years ago, # |   0 what is the test case no-27 for problem D
•  12 years ago, # ^ |   0 Field 27 × 27 with 700 random stars. You need to find constellation number 1107, and it exists.
 12 years ago, # |   -8 what is test case 10 of  problem c ... plzz post the correct answer also
•  12 years ago, # ^ |   0 i think it's data type problem, if you are using int change to  long long because while i had the same problem i received WA at 10
 12 years ago, # |   0 Really enjoy the contest.The first time for me to participate.I missed several previous contests since they were in the midnight.
•  12 years ago, # ^ |   0 I guess this one was specially prepared for the people of western countries.
•  12 years ago, # ^ |   0 In China  ,it's 15:00  in holiday ! A wonderful  time.
 12 years ago, # |   +1 System testing for out-of-competition participants completed. Sorry for delay.
 12 years ago, # |   +4 Probably the shortest solution for Problem B could be solved using java - code.replaceAll("--","2"). replaceAll("-\\.","1").replaceAll("\\.","0");:)
 12 years ago, # | ← Rev. 2 →   0 Hello, i can't solve problem E, i can't figure it out how can i find the point(on the mirror) where those 2 see each other and then see if the "line of sight" intersects the wall(they SEE each other or they don't).Please send me a private message with your solution or some hints. Thx:)
•  12 years ago, # ^ | ← Rev. 2 →   +12 Let's reflect man's point A along the line M1 M2; denote this point as C (we can think of it as a "fake image" of point A).Then the segment BC intersects then M1 M2 segment exactly in the point necessary to you - it's the point where the ray from point A should reflect from the mirror to reach point B.So, in this problem you have to know how to reflect some point from a line, to check whether the point lies on a segment M1 M2, and then check that the ray haven't intersected the wall W1 W2.
•  12 years ago, # ^ |   0 Let's reflect man's point A along the line M1 M2; denote this point as C (we can think of it as a "fake image" of point A).Then the segment BC intersects then M1 M2 segment exactly in the point necessary to you - it's the point where the ray from point A should reflect from the mirror to reach point B.So, in this problem you have to know how to reflect some point from a line, to check whether the point lies on a segment M1 M2, and then check that the ray haven't intersected the wall W1 W2.
 12 years ago, # |   0 When is the next round?
 12 years ago, # | ← Rev. 2 →   0 Thx e-maxx!! I still have a question. If you have the kids at location (0,0) and (10,0) and the wall between (2,0) and (5,0) do they see each other? ( excepting the mirror)
•  12 years ago, # ^ |   +1 No, they can't see each other. But, as it is said in the description, if it were not a wall but a mirror ((2,0)-(5,0)), then answer would be YES (the mirror isn't an obstacle in this case).
•  12 years ago, # ^ |   0 Ok, thx:)
•  12 years ago, # ^ |   0 I can't pass test 5 with my best solution...can you please share it to me? Thx
 12 years ago, # |   +2   What is test 17 for problem C?
•  12 years ago, # ^ |   +1 input: 999463 261665 981183answer: 9566472400
•  12 years ago, # ^ |   0 Thanks, with the data I found my mistake and got an AC!
 12 years ago, # |   +2 What's test 2 in problem C? And the answer?
 12 years ago, # |   0 What's the test #76 for problem E?, thanks
 12 years ago, # |   0 In some contest(http://codeforces.com/contest/1/problem/C) ...when I output nothing ,they return me "Presentation error" , do anyone konw why?
•  12 years ago, # ^ |   0 OutputOutput the smallest possible area of the ancient arena. This number should be accurate to at least 6 digits after the decimal point."Nothing" doesn't conform to this specification, hence PE.
 12 years ago, # |   0 Hi, can someone give me the test #5 for problem E? I can't pass it. Thx:)