### izban's blog

By izban, 8 years ago, translation,

Hello everybody!

Today, Codeforces Round #137 for the Second Division Participants will take place. As usual, all other interested persons can take part in it.

The problems have been developed by a group of authors from Vladivostok: Ilya Zban (izban), Alexey Evsyukov (aevsyukov), Zakhar Voit (Zakhar_Voit).

Gerald Agapov (Gerald) has greatly contributed as well and we thank him for it. The translation of the problems has been done by Maria Belova (Delinur) — thanks to her! We are also grateful to Pavel Kunyavskiy (kuniavski), who has help us in the preparation of the contest.

We hope you will have fun and like this round. The points distribution will be standard (500 — 1000 — 1500 — 2000 — 2500).

Good luck to everybody!

UPD: The start will be 15 minutes later due to technical reasons, we apologize.

UPD2: Congratulation to winners!

In second division:

1: zxl0714

2: resodo

4: edly02

5: CCC

8: siralop

10: b821213

In first division:

1: navi

2: Shik

3: GAGGUY

UPD3: The editorial is published.

• +115

 » 8 years ago, # |   +2 I am a novice and competing first time on codeforces. Can you please guide me through the blueprints of competition process. Thanks for your help in advance!
•  » » 8 years ago, # ^ |   +8 You can read FAQ(http://www.codeforces.com/help) or write a virtual contest
•  » » » 8 years ago, # ^ | ← Rev. 2 →   -9 Good Luck & Have Fun :)
 » 8 years ago, # | ← Rev. 2 →   -6
 » 8 years ago, # |   +2 thanks
 » 8 years ago, # |   +4 Codeforces servers went owie. :(
 » 8 years ago, # |   0 Let's hope in short and clear statements :)
 » 8 years ago, # |   +2 Eat lunch as fast as you can... and wait 12minutes for contest start :D
•  » » 8 years ago, # ^ |   0 Life is evil :)
 » 8 years ago, # |   0 What's the trouble before?
 » 8 years ago, # |   0 Can someone explain test 1 on div2 C problem? Why is it: 2 3 2 1 1 1 1 and not for example: 1 1 2 1
•  » » 8 years ago, # ^ |   +2 Codeforces rules forbid asking about problems during the contest.
•  » » » 8 years ago, # ^ |   0 It is related to the clarity of the test case , I think, but nvm :)
•  » » » » 8 years ago, # ^ |   +6 You can ask on the contest page
 » 8 years ago, # |   -10 I can't understand problem C and D mean. :|
 » 8 years ago, # |   +1 Could anyone give me an Idea for solving C without having to decompose all the values to its prime factors (this strategy gave me TLE)? Or is it mandatory to do that and my implemtation was simply too slow?
•  » » 8 years ago, # ^ |   +1 Are You using Eratostenes sieve or naive approach?
 » 8 years ago, # |   +1 When I finally did dare to lock my C, I found that I can hack 2 solutions with max tests, then the contest ended. Sigh. Seems courage is really important.
 » 8 years ago, # |   +3 There was a slight error in the problem description. The "Input" says columns will be given first then the rows. However, the examples showed that this was not the case. Anyway, the round was good.
•  » » 8 years ago, # ^ |   0 Thanks you.
•  » » 8 years ago, # ^ | ← Rev. 2 →   -7
 » 8 years ago, # |   +6 Very long systest.
•  » » 8 years ago, # ^ |   0 I feel there was not a need for so many test cases for Problem B. Perhaps that is why systests are slow.
•  » » » 8 years ago, # ^ |   0 Yes it's very slow. Now it reach the first hour submission in one hour to.
 » 8 years ago, # |   +5 Reds( http://www.codeforces.com/contest/222/submission/2109757 ) can also fail div-2's A. Well done problem setters! :)
 » 8 years ago, # |   0 Is there a particular reason why the two pointer solution gives TLE when using library sort in Java but gives AC when using library sort in C++? Is it Java I/O or the library sort? I see that uwi has an AC Java solution using radix sort, but I am yet to see an AC Java solution using Arrays.sort.
•  » » 8 years ago, # ^ | ← Rev. 2 →   +2 google "java sort hack site:codeforces.com". in a nutshell: int[] a; Arrays.sort(a); // — N^2 operations Integer[] a; Arrays.sort(a); // — N Log N operations
•  » » » 8 years ago, # ^ | ← Rev. 2 →   +5 The root of this problem is that Java uses mergesort to sort Reference types and qsort to sort Basic types. So simple anti-qsort test can fail all your attempts when you sort int[] instead of Integer[]
 » 8 years ago, # |   +1 if (a >= 'A' && a <= 'Z') a -= 'A' + 26; So, stupid of me! This cost me E. Wasted too much time on A, so didn't had time to debug :(. Anyway, I feel happy that my approach was correct. It was a good problem set. Thanks!
 » 8 years ago, # |   +4 I think the problems in this contest is so simple that too many people killed all the problems :(
 » 8 years ago, # | ← Rev. 4 →   0 Hi, I have a question on test 8 of Problem D. The test is : 10 53 1 1 2 1 3 1 1 2 32 1 3 2 1 3 3 3 3 1If we sort the array we will get: 6 5 5 4 4 4 4 4 2 2 So isn't the worst place is 3 ? But the answer is 5, i don't get this.
•  » » 8 years ago, # ^ | ← Rev. 2 →   0 You arrange the resulting array in not optimal way.It's possible to do so: (3 + 3) (3 + 3) (3 + 2) (3 + 2) (3 + 2) ...and our guy has 5 points, so he's on the 5th place.
•  » » » 8 years ago, # ^ |   0 Thank you a lot.My bad. I thought 1 column is the points of 1 person.
•  » » » » 8 years ago, # ^ |   0 In second example testcase from problem statement you could see that this is not true :P
 » 8 years ago, # |   +8 user editorial for the round please?
•  » » 8 years ago, # ^ |   +8 It's coming soon.
 » 8 years ago, # |   0 Can someone please explain the correctness of C problem. Actually I understood the approach, but i am not able to figure out why it will work Thanks.