Hello!
The first problem of the day is a div2F from a recent Codeforces Round, please check it out!
You can join the server in order to suggest new POTDs, and subscribe to the channel for more content!
# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 157 |
6 | Qingyu | 156 |
7 | djm03178 | 151 |
7 | adamant | 151 |
9 | luogu_official | 150 |
10 | awoo | 147 |
Hello!
The first problem of the day is a div2F from a recent Codeforces Round, please check it out!
You can join the server in order to suggest new POTDs, and subscribe to the channel for more content!
Name |
---|
Very nice initiative. Thank You!
Maybe add a link to the problem in your next blog post as well? I know it's not very hard to find the problem but a link will just make it easier.
Yeah, I will do this, thanks for suggestion!
Graph : You can't solve me like a tree.
DFS tree : Are you sure about that?