| ID | Problem Show tags Hide tags | AC / Tried | Difficulty | |
|---|---|---|---|---|
| 8207 | P1787D Game on Axis | 0 / 0 | 6 | |
| 8245 | P1788F XOR, Tree, and Queries | 0 / 0 | 9 | |
| 8196 | P1790F Timofey and Black-White Tree | 0 / 0 | 7 | |
| 8195 | P1790G Tokens on Graph | 0 / 0 | 8 | |
| 8181 | P1792F1 Graph Coloring (easy version) | 0 / 0 | 10 | |
| 8180 | P1792F2 Graph Coloring (hard version) | 0 / 0 | 10 | |
| 8232 | P1795G Removal Sequences | 0 / 0 | 10 | |
| 8254 | P1800E1 Unforgivable Curse (easy version) | 0 / 0 | (None) | |
| 8253 | P1800E2 Unforgivable Curse (hard version) | 0 / 0 | (None) | |
| 8291 | P1801D The way home | 0 / 0 | (None) | |
| 8298 | P1804E Routing | 0 / 0 | (None) | |
| 8297 | P1804F Approximate Diameter | 0 / 0 | (None) | |
| 8358 | P1805E There Should Be a Lot of Maximums | 0 / 0 | (None) | |
| 8319 | P1809F Traveling in Berland | 0 / 0 | 9 | |
| 8344 | P1810E Monsters | 0 / 0 | 7 | |
| 8371 | P1811F Is It Flower? | 0 / 0 | 7 | |
| 8397 | P1815B Sum Graph | 0 / 0 | 7 | |
| 8396 | P1815C Between | 0 / 0 | 8 | |
| 8393 | P1815F OH NO1 (-2-3-4) | 0 / 0 | 10 | |
| 8433 | P1817B Fish Graph | 0 / 0 | 6 |
By signing up a 追梦算法网 universal account, you can submit code and join discussions in all online judging services provided by us.