Codeforces celebrates 10 years! We are pleased to announce the crowdfunding-campaign. Congratulate us by the link https://codeforces.com/10years. ×

By natalia, 9 years ago, ,
Good day to everybody!

I am glad to invite you to participate in the next round of the series of winter programming school olympiads, that will be held on the 6th of November at 14:00 MSK.

The contest is official for school teams, and unofficial and not rated for everyone else. Remember, that if you have a school team, you must register all the participants for the series, if you haven't done it yet.

The duration of the contest will be 5 hours, and the rules are standard ACM ICPC.

The problems were prepared by me, Dmitry Matov, Polina Bondarenko, Mikhail Mirzayanov, and also by Maria Belova, who translate them to English. We all hope that the contest will be interesting for you to participate.

Good luck!

UPD. Statements in PDF: russian version and english version. The statements will be available when the contest starts.

The contest is over. The winner is Gennady Korotkevich who solved 9 problems for less than 3 hours. Results are available.

Tutorial:

• +23

 9 years ago, # |   0 Good luck to all!
 9 years ago, # |   0 Can anyone tell me the test 22 of problem H? Thanks so much!
•  9 years ago, # ^ |   0 9876543210
•  9 years ago, # ^ |   0 And test no. 15 for H please? (and what was the correct answer)
•  9 years ago, # ^ |   0 17601120900014764776764048700928872725171605903217ответ: 10428170619
•  9 years ago, # ^ |   0 Hm, my program gives this result, but it hasn't passed :-(
•  9 years ago, # ^ | ← Rev. 2 →   0
•  9 years ago, # ^ |   0 Hm, my comment disappeared. Well, again: it gives me error Wrong answer, even when i run my program with that phone number, it gives exactly the same number! Is it really test no. 15?
•  9 years ago, # ^ |   0 Yes. Tell me the number of your submit.
•  9 years ago, # ^ |   0 It's 178268.
•  9 years ago, # ^ |   0 Ваше решение выдает на тесте 15 1838236027.
•  9 years ago, # ^ |   0 Hm, that's really very strange, because when i compile and run the same source with this input, it gives correct answer.
•  9 years ago, # ^ |   0 Sorry, that I write in russian, so many comments to answer...
•  9 years ago, # ^ |   0 Hm, probably solved. When i choose another compiler than GNU C++, it runs over to test 21..
•  9 years ago, # ^ |   0 Perhaps the error is not outputting 64-bit numbers correctly. If you use MinGW, output them as "%I64d" instead of "%lld".
•  9 years ago, # ^ |   0 I've got my bugs，thanks a lot
•  9 years ago, # ^ |   0 maybe you could tell me the answer too ,thanks
 9 years ago, # |   +5 fascinating...someone passed problem G using a brute-force algorithm!
•  9 years ago, # ^ |   0 god really? ntu?
 9 years ago, # |   0 When I submitted problem H by Pascal, I got "Compilation Error". After changing from "int64" into "longint", I got WA on test 15. What's wrong with Pascal compiler?
•  9 years ago, # ^ |   0 Did you try to select 'Delphi 7' compiler?
 9 years ago, # |   0 Could anyone give me the input and output for problem h #1 test case?
•  9 years ago, # ^ |   0 First test cases usually are sample tests. So, test is 12345. May be you forgot about 'except for, perhaps, her own one.' sentence, if you got 49 instead of 48?Also, if you use GCC/G++, remember that testing system works under Windows and you need to output long long with '%I64d' instead of '%lld' (like under Linux).
•  9 years ago, # ^ |   0 Thanks for your hints. What really dismays me is that neither of your points is resulted in my program: I get 48, and I use a high precision calculation instead of long long...
•  9 years ago, # ^ |   0 Can you upload your program to pastebin?
•  9 years ago, # ^ |   0 http://pastebin.com/01KV1Fi8Sure. Please check it, thanks!!!
•  9 years ago, # ^ |   0 I've got WA3.Comment freopens: use stdin and stdout.
 9 years ago, # |   0 Hi,I'm getting MLE on problem G, test 56. I have reduced memory consumption at least by a factor of 6. But there is no change and approximately at the same running time I get this error. Any help?
•  9 years ago, # ^ |   0 Correct solution for this problem requires O(n log n) memory that is not too much. See accepted solutions of other participants (using ~ 50 M). If you are getting MLE, I can suppose that your solution probably use O(n^2) memory, or it goes to infinite recursion.
•  9 years ago, # ^ |   0 thanks for your answer. I think, my program is using O(n log^2(10^7)).