ID | Problem Show tags Hide tags | AC / Tried | Difficulty | |
---|---|---|---|---|
8364 | P1814E Chain Chips | 0 / 0 | (None) | |
8363 | P1814F Communication Towers | 0 / 0 | (None) | |
8398 | P1815A Ian and Array Sorting | 0 / 0 | 4 | |
8397 | P1815B Sum Graph | 0 / 0 | 7 | |
8396 | P1815C Between | 0 / 0 | 8 | |
8395 | P1815D XOR Counting | 0 / 0 | 10 | |
8394 | P1815E Bosco and Particle | 0 / 0 | 10 | |
8393 | P1815F OH NO1 (-2-3-4) | 0 / 0 | 10 | |
8392 | P1816A Ian Visits Mary | 0 / 0 | 3 | |
8391 | P1816B Grid Reconstruction | 0 / 0 | 3 | |
8434 | P1817A Almost Increasing Subsequence | 0 / 0 | 5 | |
8433 | P1817B Fish Graph | 0 / 0 | 6 | |
8432 | P1817C Similar Polynomials | 0 / 0 | 9 | |
8431 | P1817D Toy Machine | 0 / 0 | 10 | |
8430 | P1817E Half-sum | 0 / 0 | 10 | |
8429 | P1817F Entangled Substrings | 0 / 0 | 10 | |
8428 | P1818A Politics | 0 / 0 | 3 | |
8427 | P1818B Indivisible | 0 / 0 | 3 | |
8390 | P1819A Constructive Problem | 0 / 0 | 4 | |
8389 | P1819B The Butcher | 0 / 0 | 6 |
By signing up a 追梦算法网 universal account, you can submit code and join discussions in all online judging services provided by us.