We have put 2014 ACM-ICPC Xi'an Regional Contest, one of this year's Chinese regional contest in Codeforces Gym.
The 2014 ACM-ICPC Asia Xi‘an Regional Contest (2014) takes place on 25 Oct 2014 — 26 Oct 2014 in Xi'an, China. The problem set was prepared by Fudan University.
Standings are translated to English by matching their team names and their registration info on ICPC official website. For those schools which didn't register on ICPC official website, I have manually "translated" (in fact, Google and Copy & Paste) their school name to English. Inform me if you found any mistake.
Problem G has slightly looser time limit than onsite contest: alternative solutions run way slower on Codeforces, while model solution runs way faster.
Today, on December 17 at 19:30 MSK regular, 283-rd Codeforces round will take place. Problems are authored by me, Mikhail Tikhomirov. Maxim Akhmedov (Zlobober) helped me with discussing and preparing the problemset, Maria Belova (Delinur) translated problem statements in English, and Georgy Chebanov (gchebanov), Alexander Mashrabov (map) and Niyaz Nigmatullin (niyaznigmatul) tested the round and helped us with finding bugs and mistakes; let's give them a round of applause!
The round will be for both divisions. The scoring is standard (not dynamic); score distribution is as follows:
Div. 1: 750-1250-1250-2000-2500
Div. 2: 500-1000-1750-2250-2250
UPD: the round is over, thanks for participating!
Grats to the winners:
Editorial is here ( UPD: now in English!).
The contest is in gym now.
The 2014 ACM-ICPC Asia Mudanjiang Regional Contest takes place on 11 Oct 2014 — 12 Oct 2014 in Mudanjiang, China. There are 11 problems in this contest. The problem set was prepared by Zhejiang Univesity. These problems also can be found at http://acm.zju.edu.cn (Problem 3819-3829).
The official results can be found at this page. Congratulations to Jilin Unversity to win the contest!
In the contest, problem A, C, D and F is written by Archon.JK, B is written by yxdb and navi, E and I is written by me(ZhouYuChen), G and J is written by zimpha, H is written by chnluyi, and K is written by prowindy. Bobgy, Flandre_Scarlet, Fancy, NeverLand.Dai and -.- also tested or discussed the problems.
Thank MikeMirzayanov for helping us migrating the problems to Codeforces!
Any suggestions or feedback is welcome.
Codeforces Round #282 will be held at 13th of December, 19:30 MSK. Please don't note anything since the time is the usual time of contests.
We'd like to thank Zlobober who helped us a LOT for preparing the problems, MikeMirzayanov for the Polygon and Codeforces platforms and delinur for helping us in preparing statements and translating them.
Our special thanks goes to mruxim for testing the round.
The problems will be sorted according to the estimated order of difficulty according to our opinion but we strongly recommend you to read all of the problems.
As always the update regarding score distribution will be posted just before the round starts. :)
UPD: It was written that contest starts at 20:00 MSK. it was a mistake and is fixed now. The round starts at usual time 19:30 MSK.
UPD2: We also thank niyaznigmatul for testing our round.
UPD3: Score distribution:
As you might have noticed, the scores can now be multiples of 250 as well. Let's thank Codeforces team for adding this feature!
Good luck and Have fun!
UPD4: Congratulations to the winners of both divisions:
The editorial for all problems except D and E Div1 are ready and can be found here. It'll be completed soon.
We thank you all for participating and hope you had a good time.
UPD5: The editorial is now complete and can be found here.
On 3rd December, 18:00 at Moscow will be Codeforces Round #281 (Div. 2). As usual Div. 1 contestants can take part out of contest.
This is my first Codeforces Round and I hope that this isn't the last one :)
UPD1: The scoring will be dynamic.
UPD2: Contest is over. Thank to all participants. I hope you liked my contest.
UPD4 Top-5 contestants, congrats
Also congrats to gaoyihan, who solved problem E.
Greetings to the Codeforces community!
Regular Codeforces round #280 for participants from the second division will take place on 1 December, 19:30 MSK. Participants from the first division are able to participate out of the contest.
It is my first round on Codeforces. Hope you will enjoy this round.
I want to thank Max Akhmedov (Zlobober) for help with preparation of this round, Maria Belova (Delinur) for translation of statements and Mike Mirzayanov (MikeMirzayanov) for great Codeforces and Polygon systems.
Participants will be given five problems and two hours to solve these problems.
UPD: Scoring is standard — 500-1000-1500-2000-2500.
UPD: Thanks to everyone, who participated in the round!
Congratulations to the winners:
UPD: Editorial is here.
Welcome to 2014-2015 CT S02E11: Codeforces Trainings Season 2 Episode 11. The training duration is 5 hours. It is opened for teams as well as for individual participants. After the end you may use the practice mode to complete problem solving. Also it will be availible as a virtual contest for whose of you who can't take part today. Please, do not cheat. Only fair play!
It is possible that the problems will be too easy for some participants, it is possible that we will add some problems.