Комментарии
На dragoonYandex Final - Problem C, 7 месяцев назад
0
Thanks :) Nice problem, simple soln but not obvious :)
На yaroProblemset analysis (Yandex, Round 2), 12 месяцев назад
0
C and D
На yaroProblemset analysis (Yandex, Round 2), 12 месяцев назад
+5
It would have been great if you could submit your solution and give the link to your solution. Or atleast we could see through history of submission.
ztraining is another good site for ioi practice.
На hari6988A Algorithm Puzzle, 14 месяцев назад
-5
at ith iteration, take the new one by 1/i probability.
На Alex_KPRCodeforces Beta Round #58, 15 месяцев назад
-1
For mistake in A, if we delayed in other problems then why should our ratings be decreased?
На Alex_KPRCodeforces Beta Round #58, 15 месяцев назад
+7
If you rate, those who get points by challenging codes which were based on mistaken statement would get advantage over others. So I vote for: Don't Rate
На e-maxxCodeforces Beta Round #50: Разбор задачи C, 16 месяцев назад
0
I was just wondering, if the second part (DP) could be solved in < O(n^2). Is there any way?
I am disappointed to see this post. I agree with sazzad and many others. Whether you will participate in salat or cf thats your priority. I will not say you must choose salat or you must choose cf. And it is completely your personal priority choosing. What you could do is inform Mike about the friday matter. But I found your posts and comments quite offensive.
На MikeMirzayanovCodeforces Beta Round #48, 17 месяцев назад
+5
Some of the test cases are too big to copy. How to get them?
i dont understand, why sum of first n, or n of first n+1 will yield (0,0) sum.
Head was out when saw A's sample does not match but still some people managed to get AC. So waited.. then got the message to submit :( unfortunate lost 10min valuable time :(
На SpookyCookieSummer Programming School in Sevastopol, 22 месяца назад
+8
To the organizers, If it is possible then share the teaching materials with us :) It will be great help for us.
На SkidanovAlexThe 12 chairs and diamonds., 2 года назад
0
these days i am reading the prblems wrong. i read, the diamond is hidden in one of the chairs with 90% probability.  .........
На SkidanovAlexThe 12 chairs and diamonds., 2 года назад
-1
i guess it is 1?
На hadiCookie Choice (ZJU #3164), 2 года назад
0
oh sorry. actually i misread the problem. i thought all the elements are atleast in one group. then the problem becomes trivial and i was not sure why you are doing such hard dp :P
На hadiCookie Choice (ZJU #3164), 2 года назад
0
how will you handle the group? only one cookie allowed from each group. 
На hadiCookie Choice (ZJU #3164), 2 года назад
0
how will you handle the group? only one cookie allowed from each group. 
На dragoonWhat is the solution of C, round 3, 2 года назад
-1
i am sorry, actually i wanted to mean problem D. :( I have to repost :( I sucked in my first post :(
На dragoonWhat is the solution of C, round 3, 2 года назад
-1
i am sorry, actually i wanted to mean problem D. :( I have to repost :( I sucked in my first post :(