Comments
On Tanzir5 → 3 contests in 3 days!, 10 years ago
+22

You'll thank me later
On Arpa → Codeforces Round #383, 10 years ago
+25

I hope today it won't be delayed again..
On ma5termind → HackerRank HourRank-15, 10 years ago
+5 
dp[a][b][c] = ((1 — c) * (a * dp[a — 1][b][0] + b * dp[a + 1][b — 1][1]) + c * ((a — 1) * dp[a — 1][b][0] + b * dp[a+1][b-1][1])) % mod

the answer will be dp[number_of_numbers_which_appear_once][number_of_numbers_which_appear_twice][0]
+18

I think you should give us a recompense for moral damages and prepare more rated contests on the next week
On Arpa → Codeforces Round #383, 10 years ago
0

Till now the most frequent comment was "Is it rated ?"

Now it'll be "Will it be delayed?" or "I hope it won't be delayed" or "Is the hardware ok?"
0

Try submitting in c++14 instead of C11.
On animeshf → What just happened?, 10 years ago
-9

Make codeforces great again...
On Arpa → Codeforces Round #383, 10 years ago
-20

you meant palindromic prime ?
-52

Nice contest !
0

Where are the results ?

+3

This one is definetly the best one! There is no motto more orignial than this one. I think it should win!
0

I'm on Codeforces . Don't Dijkstract me !
-49

Where are the rating changes???
+83

Will the problems be harder than the problems from the intel elimination round ?