### lperovskaya's blog

By lperovskaya, history, 3 years ago, translation, ,

Final round of Yandex.Algorithm-2015 will start tomorrow, on August 6, 2015 at 13:00 MSK. 28 finalists will compete for the total prize of 540 000 rubles.

Follow the contest on Yandex.Algorithm website.

UPD Congratulations to Yandex.Algorithm-2015 champion tourist! Second place goes to Petr eatmore takes third place

•
• +64
•

 » 3 years ago, # |   +16 When did tourist not win onsite finals?
•  » » 3 years ago, # ^ |   +41 VK Cup 2012, IOI 2012.By the way, I would not call this round 'onsite'.
•  » » 3 years ago, # ^ |   -39 Today.
•  » » 3 years ago, # ^ |   +3 FBHC 2013
•  » » 3 years ago, # ^ |   +90 All-Ukrainian Olympiads in Informatics 2015
 » 3 years ago, # |   +16 For those who don't read Russian comments and didn't notice: there's virtual participation available now.
 » 3 years ago, # | ← Rev. 2 →   0 How to solve C if you can choose at most N/10 fractions?I was wondering why this constraint was removed.
•  » » 3 years ago, # ^ |   +8 First version of the problem had no constraint related to powers of prime as denominators, instead it had N/10 and N was between 10^5 and 2*10^5 (and no readable sample, because of this limitation). For these N number of primes P(N) is not exceeding N ~ N/10.With both of these constraints for small N, when P(N)
 » 3 years ago, # |   +8 can anyone tell the difference between check sign and plus sign (on standings) ?
•  » » 3 years ago, # ^ |   +8 Check means OK after blind submission
 » 3 years ago, # |   +38 It seems that for third year in a row Petr failed one of his "blind" submissions preventing him to claim the first place: 2013, 2014, 2015.
•  » » 3 years ago, # ^ |   +31 For third year in a row it is problem C :)
•  » » » 3 years ago, # ^ |   0 Problem C is unlucky
 » 3 years ago, # |   0 How to solve problem A?
 » 2 years ago, # |   0 I find a tutorial in the site:https://habrahabr.ru/company/yandex/blog/264253/,however it's in Russia.The English version translated is not clear.