ID | Problem Show tags Hide tags | AC / Tried | Difficulty | |
---|---|---|---|---|
5579 | P1418E Expected Damage | 0 / 0 | (None) | |
5593 | P1422C Bargain | 0 / 0 | (None) | |
5607 | P1425D Danger of Mad Snakes | 0 / 0 | (None) | |
5612 | P1426F Number of Subsequences | 0 / 0 | (None) | |
5642 | P1436F Sum Over Subsets | 0 / 0 | (None) | |
5646 | P1437F Emotional Fishermen | 0 / 0 | (None) | |
5653 | P1439D INOI Final Contests | 0 / 0 | (None) | |
5656 | P1442B Identify the Operations | 0 / 0 | (None) | |
5661 | P1444B Divide and Sum | 0 / 0 | (None) | |
5676 | P1450H2 Multithreading (Hard Version) | 0 / 0 | (None) | |
5682 | P1452D Radio Towers | 0 / 0 | (None) | |
5691 | P1454E Number of Simple Paths | 0 / 0 | (None) | |
5708 | P1462E1 Close Tuples (easy version) | 0 / 0 | (None) | |
5718 | P1466H Finding satisfactory solutions | 0 / 0 | (None) | |
5753 | P1475C Ball in Berland | 0 / 0 | (None) | |
5754 | P1475E Advertising Agency | 0 / 0 | (None) | |
5764 | P1477F Nezzar and Chocolate Bars | 0 / 0 | (None) | |
5786 | P1486F Pairs of Paths | 0 / 0 | (None) | |
5790 | P1487G String Counting | 0 / 0 | (None) | |
5795 | P1488H Build From Suffixes | 0 / 0 | (None) |
By signing up a 追梦算法网 universal account, you can submit code and join discussions in all online judging services provided by us.