Comments - Codeforces

→ Pay attention

Before contest
Educational Codeforces Round 195 (Rated for Div. 2)
10:01:34
Register now »

→ Streams

By aryanc403

Before stream 12:11:33

View all →

→ Top rated

#	User	Rating
1	Benq	3676
2	jiangly	3670
3	Kevin114514	3657
4	maroonrk	3355
5	Um_nik	3353
6	squareOf105	3346
7	tourist	3343
8	strapple	3324
9	heuristica	3322
10	jiangbowen	3291

Countries | Cities | Organizations

View all →

→ Top contributors

#	User	Contrib.
1	Qingyu	158
2	nik_exists	150
2	maspy	150
4	AmShZ	143
5	Um_nik	141
6	Errichto	139
7	adamant	137
8	BledDest	133
8	maroonrk	133
10	qwexd	130

View all →

→ Find user

→ Recent actions

Detailed →

Comments

yagami___

On atcoder_official → Hitachi Vantara Programming Contest 2024（AtCoder Beginner Contest 368） Announcement, 2 years ago

Use Grundy Theorem ( short explanation ) :
Consider a graph, in which from node x you can go to node y then, the grundy function for each node = MEX of the grundy function of child nodes. and the xor of all grundy values determines the winning or losing state.

yagami___

On atcoder_official → AtCoder Beginner Contest 367 Announcement, 2 years ago

Can you explain your approach for the problem E ?

yagami___

On MarkBcc168 → Codeforces Round #807 (Div 2.) Editorial, 4 years ago

Can you share your Approach towards problem D?

yagami___

On tejas10p → Invitation to CodeChef May Starters 40 (Rated for Div 2, 3 & 4) — 26th May ( Unrated ), 4 years ago

Looks like Nobody going to have it :(

yagami___

On tejas10p → Invitation to CodeChef May Starters 40 (Rated for Div 2, 3 & 4) — 26th May ( Unrated ), 4 years ago

Still 502 Bad gateway

yagami___

On awoo → Educational Codeforces Round 117 [Rated for Div. 2], 5 years ago

Great Explanation

The only programming contests Web 2.0 platform

Server time: Oct/14/2026 07:33:27 (f1).

Desktop version, switch to mobile version.

Supported by