Thanks for the participation!
And now the editorial:
Thanks for the participation!
And now the editorial:
Tomorrow will take place All-Russian olympiad for students of 5-8 grades, in the name of Keldysh. Good luck to all the participants! Olympiad is conducted under the guidance of the Moscow Olympiad Scientific Committee, in particular GlebsHP, ch_egor, Endagorion, gritukan, Zlobober, _meshanya_, _kun_ and, of course, Helen Andreeva.
We are happy to announce the codeforces round based on the problems of this olympiad! It will be a Div. 2 round, which will take place at Jun/16/2019 12:35 (Moscow time). You might have already participated in rounds based on the school olympiads, prepared by Moscow Olympiad Scientific Committee (rounds 327, 342, 345, 376, 401, 433, 441, 466, 469, 507, 516, 541, 545)
Also I would like to thank the Tinkoff company and personally Tatyana Kolinkova for organizing the onsite competition.
upd. Congratulations to winners!
unofficial Div. 1:
The editorial will be published soon.
upd. the editorial was published.
And now the editorials:
Right now happens the first tour of the Open Olympiad in Informatics, and tomorrow will be the second one. This contest is prepared by Moscow Olympiad Scientific Committee that you may know by Moscow Team Olympiad, Moscow Olympiad for Young Students and Metropolises Olympiad (rounds 327, 342, 345, 376, 401, 433, 441, 466, 469, 507, 516, 541)
Open Olympiad consists of the most interesting and hard problems that are proposed my a wide community of authors, so we decided to conduct a Codeforces regular round based on it, which will happen Mar/08/2019 12:05 (Moscow time) and will be based on both days of the Olympiad. Each division will have 6 problems and 2:30 hours to solve them.
We kindly ask all the community members that are going to participate in the competition to show sportsmanship by not trying to cheat in any manner, in particular, by trying to figure out problem statements from the onsite participants. If you end up knowing some of the problems of Moscow Open Olympiad (by participating in it, from some of the onsite contestants or in any other way), please do not participate in the round. We also ask onsite contestants to not discuss problems in public. Failure to comply with any of the rules above may result in a disqualification.
Problems of this competition were prepared by V--gLaSsH0ldEr593--V, isaf27, Flyrise, _kun_, GlebsHP, ch_egor, Zlobober, qoo2p5, grphil, achulkov2, Schemtschik, akvasha, mingaleg, V--o_o--V, wrg0ababd, guided by ch_egor, _kun_, GlebsHP, Zlobober and Helen Andreeva.
Good luck everybody!
UPD: Congratulations to the winners!
The editorial will appear soon
UPD: The editorial
The round has finished. I hope you liked it!
Credits to the round authors and developers:
And now, the editorial:
Div2A ("Palindrome Dance") was authored by jury members altogether, development: darnley
Some editorials are being published, please wait a bit :)
These days Moscow is conducting the 3rd International Olympiad of Metropolises that is an international competition for high school students from biggest cities and capitals all around the world. One of the disciplines of the competition is informatics. Rounds of the competition were prepared by the jury members invited from St. Petersburg, Minsk, Belgrade and Moscow olympiad scientific committee which you may know by Moscow team Olympiad, Open Olympiad in Informatics and Moscow Olympiad for young students (rounds 327, 342, 345, 376, 401, 433, 441, 466, 469).
Scientific Committee of the olympiad consists of: darnley, Endagorion, Jelena Hadži-Purić, Elena Andreeva, Zlobober, GlebsHP. The problems were developed by kraskevich, ch_egor, _kun_, Schemtschik, GoToCoding, malcolm, akvasha, darnley, alkurmtl, achulkov2, gritukan under the guidance of GlebsHP and Zlobober.
Problems were adapted for codeforces by KAN and _kun_, also thanks for MikeMirzayanov for systems codeforces and polygon, which was used to prepare problems of this olympiad. Also, thanks LHiC and V--o_o--V for testing!
Good luck and high ratings for everybody!
Round will happen on Sep/05/2018 19:35 (Moscow time) and will last for two hours. There will be 5 problems for each division.
P.S. We kindly ask everybody who knows problems of an onsite event not to participate in a round and not to discuss them in public, as this may be a subject for disqualification.
Upd: Editorial was published here!
Aaaand congratulations to winners!
Thank your for participation!
Problem D2A (New Building) was authored and prepared by burunduk2.
Problem D2B (Badge) was authored and prepared by me, the version in SIS's olympiad contained the version with n ≤ 105.
Problem D1C (Sergey's Problem) was authored and prepared by WreckingBall.
Problem D1E (Raining Season) was authored and prepared by izban.
Summer Informatics School (SIS / LKSH) is a summer school for students in grades 6-10. SIS is focused mainly (but not only) on students participating in the Olympiads in Informatics — from beginners to participants of international competitions. SIS is held in July and August, each of them is visited by about 200 students from all over Russia and abroad. The language of the camp is Russian. Additional information about SIS is posted at lksh.ru
Right now, the August branch of the Summer Computer School is running, and on August 11 the traditional team Olympiad is going to place. I am happy to present a rated round based on it!
The round will be rated for both divisions, will be held in Aug/11/2018 16:35 (Moscow time), in each division there will be 5 tasks and 2 hours to solve them.
The problems of this round and the SIS olympiad were authored and prepared by SIS's teachers: izban, achulkov2, Schemtschik, i_love_isaf27, senek_k, asokol, WreckingBall, burunduk2. Also, I would like to thank Dembel for his help with olympiad's organization.
Thank you, MikeMirzayanov, for the codeforces and polygon systems!
Yes, we are aware, that this contest clashes with ProCon Junior on codechef. However, given the schedule of the SIS and the approaching VK cup finals we can't do anything with it, sorry for that =/
UPD: The round will have one interactive problem for both divisions. Please, read the post about interactive problems here: Interactive Problems: Guide for Participants.
Congratulations to winners!
Upd Thank you for participation! Due to vk-cup conduction rating recalculation will happen slightly later, than usually.
Upd The editorial is published!
Credits to all jury members, who contributed to this round and EJOI: tourist, PavelKunyavskiy, niyaznigmatul, 300iq, GlebsHP, pashka, qoo2p5, VArtem, demon1999, flyrise, ifsmirnov, isaf27, yeputons, _kun_.
Unfortunately, we had a bug in our interactor of the interactive problem.
The interactor contains the following code:
if (y < x) t = -1; else if(y > x) t = 1; else t = 0; if(!p[q % n]) t *= -1; cout << t << "\n" << flush;
This is the opposite to the statement. However, it turns out that this error doesn't causes any harm for solving problem — it actualy just inverts the pattern, selected by judges. This also wasn't noticed during testing, by the same reason — the error is not visible to the user code.
But it may cause unexpected behaviour for hackers -- since they write the pattern themselves.
We are very sorry for this error and decided to do the following:
We are very sorry again. This is a huge lesson to us to be more attentive.
I hope you enjoyed the round!
I am happy to invite you to the codeforces round #493, which happens at Jul/01/2018 17:05 (Moscow time).
Big thanks for people, who tested round — Shiqing cyand1317 Lyu, Andrew GreenGrape Rayskiy, Ivan isaf27 Safonov, Alexey aleks5d Upirvitsky. Also thanks to Mike MikeMirzayanov Mirzayanov and Nikolay KAN Kalinin for help with round preparation.
And to Mike MikeMirzayanov Mirzayanov for codeforces and polygon systems.
Traditionally, there will be 5 problems for 2 hours. I hope you will enjoy the problemset, good luck and have fun!
Scoring distribution will be published before the round.
UPD: Scoring distribution is as follows:
Div1: 500 1250 1500 2500 3000
Div2: 500 1000 1250 2000 2500
You may also want to check this post for post-contest stream.
UPD2: The editorial was published!
UPD3: Congratulations to winners!