Comments - Codeforces

→ Pay attention

*has extra registration

→ Top rated

→ Top contributors

View all →

→ Find user

→ Recent actions

Detailed →

Comments

On TeaTime → Codeforces Round #815 (Div. 2), 4 years ago

+33

The word "subsequence" in D is quite misleading...

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

Me too...:(

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

Me:(

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

y1 can be bigger than y2

Got the same bug during contest:(

On tokitsukaze → Codeforces Round #789, 4 years ago

Ok,I get it now.Thanks!

On tokitsukaze → Codeforces Round #789, 4 years ago

I have same feeling with you;) Thanks for your helping~

On tokitsukaze → Codeforces Round #789, 4 years ago

The time complexity should be O(n^2),but I got TLE. Can somebody help me?

On highonjuice → Today was the day, 5 years ago

[deleted]

The only programming contests Web 2.0 platform

Server time: May/22/2026 11:48:32 (g1).

Desktop version, switch to mobile version.

Supported by