### Ripatti's blog

By Ripatti, 8 years ago, translation, ,

Hello everyone!

There is yet another Codeforces round. Now it is the 53-th one.
The round will run for both divisions by classic rules of Codeforces format.

Points are standard: 500-1000-1500-2000-2500.

Round was prepared by Ripatti , Alex_KPR , Gerald , Aksenov239 , RAD , Delinur .

Good luck!

UPD. Round is ended.
Winners of div1:
1. Petr
2. tourist
3. SergeyRogulenko
4. bmerry
5. UESTC_Nocturne

Winners of div2:
1. gflegar
2. cupidon4uk
3. arbesfeld

Petr is only who solved all 5 problems in the first division. No one solved all 5 problems in the second division.

UPD. Editorial.

• +138

 » 8 years ago, # |   0 0.0012 from 100010
•  » » 8 years ago, # ^ |   0 What you want to say? I'm not understanding.
•  » » » 8 years ago, # ^ |   +12 1/8 * 1000 = 125
 » 8 years ago, # | ← Rev. 2 →   -39 be careful! 5^3 is meaning something... maybe this is hint for some tasks ))
•  » » 8 years ago, # ^ |   -46 This is an algorithmic contest Mr. Sherlock Holmes :P
 » 8 years ago, # |   -26 Can we suppose fixed scoring, as it is not specified?
•  » » 8 years ago, # ^ |   +5 It is already specified that the points are standard ->500,1000,1500,2000,2500 .. So no dynamic scoring
•  » » » 8 years ago, # ^ |   -17 Nothing is obvious here.
 » 8 years ago, # |   -68 但愿不坑爹
•  » » 8 years ago, # ^ |   +3 Please comment in english :)
 » 8 years ago, # |   -12 Very tough problem set .. I could not understand what problem B wanted . :(
•  » » 8 years ago, # ^ |   0 I think that examples were clear...
•  » » 8 years ago, # ^ | ← Rev. 2 →   +1 I think this case will help you to understand this. Correct answer is 2.
 » 8 years ago, # |   +20 Looks like I will get more than minus 100 rating for birthday present T_T such bad luck T_T
•  » » 8 years ago, # ^ |   +8 Regardless, Happy Birthday! :)
 » 8 years ago, # |   0 I'm try to solve 4 problems..., and solve only one :/
 » 8 years ago, # |   +8 C is very annoying :) Got 9 WA's and still don't know what's wrong with my solution.
•  » » 8 years ago, # ^ |   +18 I had a WA 4 when I checked for line-circle intersection instead of segment-circle.
•  » » » 8 years ago, # ^ |   +8 Ehhhhh, the same mistake here.
 » 8 years ago, # |   +8 C was very fun (I didn't get it though). Thanks for a good problem set!
•  » » 8 years ago, # ^ |   0 any idea for it?
•  » » » 8 years ago, # ^ | ← Rev. 2 →   -6 the thng was tht the entire process was totally recursive..so if 1 value matches the sequence the rest will follow..;)simply simulate the expt1 till u do not exceed t..after tht both will take same number of steps....ans is n-i+1 where i is no. of steps to reach tP.S.: be careful not to output -ve..:P
•  » » » » 8 years ago, # ^ |   0 Um, no. We were talking about division one C.
•  » » » » » 8 years ago, # ^ |   0 ohh....my bad..sorryy....
 » 8 years ago, # |   0 In problem B in div 2, we just have to find number of circles(out of 4) which are not intersected by any other circle. Am I right ?Please help me someone.
•  » » 8 years ago, # ^ |   -11 Yes, you're right, my young padawan.
•  » » 8 years ago, # ^ |   +3 You have to check for every circle from each pair that it lies either in smaller of the other pair or outside bigger of the other pair. Checking only intersection is not enough as you can face a situation when a circle lies between 2 others ( exactly in the ring), so the color is not changed from white to black or vicer versa).
•  » » 8 years ago, # ^ |   0 You should find the number of circles that are not intersected by the other 'disc'. For a circle in disk 1, simply checking intersection with both circles of the other disc is not enough. For example, the 1st disc may lie entirely inside the black region of the other disc, in which case there are no circle-circle intersections, but the number of contours is 2.
 » 8 years ago, # |   0 can you add tutorials?
•  » » 8 years ago, # ^ |   0 tomorrow
•  » » » 8 years ago, # ^ |   +3 your's tmmrw never comes..:P
 » 8 years ago, # |   +10 Today is Dragon Boat Festival. Happy Dragon Boat Festival!Also, today is Alan Mathison Turing's 100th birthday.
•  » » 8 years ago, # ^ |   +4 I can add to your wonderful list that today there is another one celebration in Saint-Petersburg called Scarlet Sails show ("Алые паруса" in Russian). It's the holiday for all school-leavers. However, that event gathers not only them, but a lot of citizens and visitors of Saint-Petersburg.
•  » » 8 years ago, # ^ |   +4 Strange !! People here vote for colors not for content .. Even I wished him in my blog and got a lot of negative votes .. Sad but truth...
•  » » » 8 years ago, # ^ |   +3 The problem with your post in my opinion is: How can Turing be happy on his birthday when he has passed away many years ago ?!! So, wishing a happy birthday to him may not make that much sense.
 » 8 years ago, # |   0 Editorial ?
 » 8 years ago, # |   0 It seems a spell error? Winners if div1 -----> Winners of div1:
•  » » 8 years ago, # ^ |   0 yes, thanks