Comments
On KAN → Codeforces Round 990, 17 months ago
0

Wow! I didn't know that. It's still as strange as it is cool, though.
On KAN → Codeforces Round 990, 17 months ago
0

That would make things somewhat weird. Imagine someone seeing a master in tomorrow's official Div2 standings in the near future!
On Aris → Codeforces Round #780 (Div. 3), 4 years ago
+26

As a tester, make sure to participate in this brilliant contest.
On Aris → Codeforces Round #764 (Div. 3), 4 years ago
+1

I don't think there is any interactive problem that doesn't warn about flushing the output. Read the problem statement carefully from now on.
+13

Though, not too long ago.
0

There is too much unnecessary use of long long, use int instead and then you should be fine.

+9

Too sad we are not seeing vovuh's handle in writers part of an educational round...
+121

+12

Says the one who tagged the same person twice in one comment?
+5

First of all, most of the participants of the final round of this VK cup have written contests for CODEFORCES before. So I think they will respect other contests, if not then the same thing could happen to their contest(by testers or whatever else) and that, of course, is not what an author would want.

What you mentioned is correct, but that round was not based on the final round of another contest, if I'm not wrong it was based on an elimination round.
+40

Not achieving this goal is harder than achieving it.
+82

Come on, you hesitate between codeforces and leetcode?

0

I think he doesn't add himself willingly. If I'm not wrong, he did mention it once, but I couldn't find his comment.
0

Mike's contribution is +231 and mono-gon's is +210. I guess you know that 231 is greater than 210. Mike didn't add himself to the top contributors page.
0

I don't think so. Not yet, at least. As he mentioned before, he is working on that. He has to beat a strong opponent like Mike, after all.
+4

He is probably busy taking over the CF Empire.
+33

A common question and yet answered a lot of times. There are no rules for this. You should either be friends with setters or have experience of being a setter(the main thing is to be trustworthy).
0

I meant in problem C.
0

Priority queue works faster than multiset, except for that they don't differ.
On AmShZ → Codeforces Round #722, 5 years ago
+12

You should either be friends with setters or have a history of being a setter.
On AmShZ → Codeforces Round #722, 5 years ago
+3

Length of the round is set to be 2 hours on the contests page, please fix it. AmShZ
+12

Perhaps it would be better to say testing skills instead of improving, in an official contest participant tries to focus and think continuously, but if they try to solve a problem not in an official contest it probably won't have the same concentration because there is no time limit to solve it.
+22

I agree, but nowadays contests usually contain only math, number theory and constructive algorithms, these kind of problems aren't unnecessary, but we aren't seeing algorithms like dfs, bfs, etc in problems with difficulty lower than 2000. I know if a problem with rating say 1700 requires such algorithms will be pointless, but if someone wants to improve their skills in these algorithms it has to be with easier problems, not difficult problems they can't solve.
+1

It's normal for educational rounds, rating changes usually appear around 24 hours after the contest.
0

The condition in the problem is equivalent to finding the number of permutations of Indices of the array's elements so that ap1 and apn are bitwise and operation of all of the elements in array a. So let cnt be the number of occurrences of (a1 & a2 .. & an) in array a, if cnt is less than 2 then there is no such permutation and the answer is 0, otherwise the answer is cnt * (cnt — 1) * (n — 2)!.
+41

You know they don't delay it for fun, right?
-8

You can sit and pray the round starts after this 10 minutes.
0

25 mins late but... a new record :')