Comments

Lol, I suppose researching this page will bring more pleasure to you, here not everything is obvious

On i.eCodeforces Round #669, 6 years ago
+66

pic that is too much is already deleted

+5

What is significant difference of this algorithm from well-known merge-sort?

On Gary2005Help with math!, 6 years ago
+3

Also it can be proved by euler theorem

don't joke anymore

On Gary2005Help with math!, 6 years ago
+6

check extended euclidian algorithm. Because this algorithm works you can see that this statement is always true

On 312352145215orz, 6 years ago
-15

as always

orz 300iq

-34

Huh, really friendly time for us:

For Chinese users.

+11

Mission was failed

Huh, you can shuffle problems and do not show the cost of them to participants. It would make the ability to rate problems really useful. Also it would be more entertaining than classical format

Train to solve easy problem faster, it is also important skill

That's not true Answer is 7/8

Model of calculations:

1) possibility to choose a person = 1 / n 2) possibility to choose a gift from a list = 1 / size_of_list; 3) possibility to choose a person who would like this gift = number of good kids / n; Lets sum everything i = 1, j = 1, 1/2 * 1/2 * 1/2 = 1/8 i = 1, j = 2, 1/2 * 1/2 * 1 = 1/4 i = 2, j = 1, 1/2 * 1 * 1 = 1/2 ans = 1/2 + 1/4 + 1/8 = 7/8

Well-balanced round lol

Its the worst thing you could do this evening...

Wtf, can you pls speak about some specific conditions of round? Like anti-understandable tasks, queryforces and another awesome things

-14

Seems like some guys are really having fun of downvoting everybody everywhere(

On mnbvmarCodeforces Round #556, 7 years ago
+7

The era of non-balanced rounds on codeforces has returned, no-matter who is author

-10

NOT ONLY YOU, I JERK OFF ON HIS PHOTOS EVERY DAY

I want moooore dislikes

OMG OMG OMG OMG OMG IS IT RATED ?? ? ? ? PICKMIKE DO NOT TELL LIE TO PEOPLE IT WON'T BE RATED!!! KEKEKKEKEKEKKEKEKEKEKKEKEK