|
|
1449 |
P1288D Minimax Problem
|
0 / 0 |
(无) |
|
|
1448 |
P1288E Messenger Simulator
|
0 / 0 |
(无) |
|
|
1424 |
P1294F Three Paths on a Tree
|
0 / 0 |
(无) |
|
|
1412 |
P1296E2 String Coloring (hard version)
|
0 / 0 |
(无) |
|
|
1391 |
P1301D Time to Run
|
0 / 0 |
(无) |
|
|
1367 |
P1304E 1-Trees and Queries
|
0 / 0 |
(无) |
|
|
1340 |
P1311D Three Integers
|
0 / 0 |
(无) |
|
|
1318 |
P1316D Nash Matrix
|
0 / 0 |
(无) |
|
|
1313 |
P1320C World of Darkraft: Battle for Azathoth
|
0 / 0 |
(无) |
|
|
1186 |
P1344B Monopole Magnets
|
0 / 0 |
(无) |
|
|
1174 |
P1346F Dune II: Battle For Arrakis
|
0 / 0 |
(无) |
|
|
1163 |
P1349B Orac and Medians
|
0 / 0 |
(无) |
|
|
1162 |
P1349C Orac and Game of Life
|
0 / 0 |
(无) |
|
|
1136 |
P1354C2 Not So Simple Polygon Embedding
|
0 / 0 |
(无) |
|
|
1088 |
P1359D Yet Another Yet Another Task
|
0 / 0 |
(无) |
|
|
1087 |
P1359E Modular Stability
|
0 / 0 |
(无) |
|
|
1064 |
P1363E Tree Shuffling
|
0 / 0 |
(无) |
|
|
1047 |
P1366D Two Divisors
|
0 / 0 |
(无) |
|
|
1018 |
P1370D Odd-Even Subsequence
|
0 / 0 |
(无) |
|
|
976 |
P1379C Choosing flowers
|
0 / 0 |
(无) |
|
|
968 |
P1380D Berserk And Fireball
|
0 / 0 |
(无) |
|
|
943 |
P1385E Directing Edges
|
0 / 0 |
(无) |
|
|
930 |
P1388D Captain Flint and Treasure
|
0 / 0 |
(无) |
|
|
918 |
P1391D 505
|
0 / 0 |
(无) |
|
|
875 |
P1399E1 Weights Division (easy version)
|
0 / 0 |
(无) |
|
|
833 |
P1408D Searchlights
|
0 / 0 |
(无) |
|
|
805 |
P1415D XOR-gun
|
0 / 0 |
(无) |
|
|
801 |
P1416B Make Them Equal
|
0 / 0 |
(无) |
|
|
800 |
P1416C XOR Inverse
|
0 / 0 |
(无) |
|
|
734 |
P1426F Number of Subsequences
|
0 / 0 |
(无) |
|
|
731 |
P1427C The Hard Work of Paparazzi
|
0 / 0 |
(无) |
|
|
730 |
P1427D Unshuffling a Deck
|
0 / 0 |
(无) |
|
|
705 |
P1431E Chess Match
|
0 / 0 |
(无) |
|
|
676 |
P1438C Engineer Artem
|
0 / 0 |
(无) |
|
|
624 |
P1451E1 Bitwise Queries (Easy Version)
|
0 / 0 |
(无) |
|
|
604 |
P1454E Number of Simple Paths
|
0 / 0 |
(无) |
|
|
593 |
P1458B Glass Half Spilled
|
0 / 0 |
(无) |
|
|
470 |
P1481D AB Graph
|
0 / 0 |
(无) |
|
|
442 |
P1487E Cheap Dinner
|
0 / 0 |
(无) |
|
|
406 |
P1493C K-beautiful Strings
|
0 / 0 |
(无) |
|
|
338 |
P1506F Triangular Paths
|
0 / 0 |
(无) |
|
|
337 |
P1506G Maximize the Remaining String
|
0 / 0 |
(无) |
|
|
299 |
P1513D GCD and MST
|
0 / 0 |
(无) |
|
|
293 |
P1514D Cut and Stick
|
0 / 0 |
(无) |
|
|
253 |
P1521C Nastia and a Hidden Permutation
|
0 / 0 |
(无) |
|
|
240 |
P1525C Robot Collisions
|
0 / 0 |
(无) |
|
|
165 |
P1536D Omkar and Medians
|
0 / 0 |
(无) |
|
|
80 |
P1551E Fixed Points
|
0 / 0 |
(无) |
|
|
34 |
P1558C Bottom-Tier Reversals
|
0 / 0 |
(无) |
|
|
7365 |
P1582E Pchelyonok and Segments
|
0 / 0 |
(无) |
|
|
7448 |
P1680E Moving Chips
|
0 / 0 |
(无) |
|
|
7437 |
P1682D Circular Spanning Tree
|
0 / 0 |
(无) |
|
|
7425 |
P1685B Linguistics
|
0 / 0 |
(无) |
|
|
7398 |
P1690G Count the Trains
|
0 / 0 |
(无) |
|
|
7535 |
P1881G Anya and the Mysterious String
|
0 / 0 |
7 |
|
|
7502 |
P1889C1 Doremy's Drying Plan (Easy Version)
|
0 / 0 |
7 |
|
|
7490 |
P1891F A Growing Tree
|
0 / 0 |
7 |
|
|
7487 |
P1893C Freedom of Choice
|
0 / 0 |
7 |
|
|
7954 |
P1984D "a" String Problem
|
0 / 0 |
7 |
|
|
7928 |
P1987E Wonderful Tree!
|
0 / 0 |
7 |
|
|
7919 |
P1988D The Omnipotent Monster Killer
|
0 / 0 |
7 |
|
|
7888 |
P1992G Ultra-Meow
|
0 / 0 |
7 |
|
|
7883 |
P1994E Wooden Game
|
0 / 0 |
7 |
