|
|
1676 |
P1294F Three Paths on a Tree
|
0 / 0 |
(无) |
|
|
1664 |
P1296E2 String Coloring (hard version)
|
0 / 0 |
(无) |
|
|
1643 |
P1301D Time to Run
|
0 / 0 |
(无) |
|
|
1619 |
P1304E 1-Trees and Queries
|
0 / 0 |
(无) |
|
|
1592 |
P1311D Three Integers
|
0 / 0 |
(无) |
|
|
1570 |
P1316D Nash Matrix
|
0 / 0 |
(无) |
|
|
1565 |
P1320C World of Darkraft: Battle for Azathoth
|
0 / 0 |
(无) |
|
|
1438 |
P1344B Monopole Magnets
|
0 / 0 |
(无) |
|
|
1426 |
P1346F Dune II: Battle For Arrakis
|
0 / 0 |
(无) |
|
|
1415 |
P1349B Orac and Medians
|
0 / 0 |
(无) |
|
|
1414 |
P1349C Orac and Game of Life
|
0 / 0 |
(无) |
|
|
1388 |
P1354C2 Not So Simple Polygon Embedding
|
0 / 0 |
(无) |
|
|
1340 |
P1359D Yet Another Yet Another Task
|
0 / 0 |
(无) |
|
|
1339 |
P1359E Modular Stability
|
0 / 0 |
(无) |
|
|
1316 |
P1363E Tree Shuffling
|
0 / 0 |
(无) |
|
|
1299 |
P1366D Two Divisors
|
0 / 0 |
(无) |
|
|
1270 |
P1370D Odd-Even Subsequence
|
0 / 0 |
(无) |
|
|
1228 |
P1379C Choosing flowers
|
0 / 0 |
(无) |
|
|
1220 |
P1380D Berserk And Fireball
|
0 / 0 |
(无) |
|
|
1195 |
P1385E Directing Edges
|
0 / 0 |
(无) |
|
|
1182 |
P1388D Captain Flint and Treasure
|
0 / 0 |
(无) |
|
|
1170 |
P1391D 505
|
0 / 0 |
(无) |
|
|
1127 |
P1399E1 Weights Division (easy version)
|
0 / 0 |
(无) |
|
|
1085 |
P1408D Searchlights
|
0 / 0 |
(无) |
|
|
1057 |
P1415D XOR-gun
|
0 / 0 |
(无) |
|
|
1053 |
P1416B Make Them Equal
|
0 / 0 |
(无) |
|
|
1052 |
P1416C XOR Inverse
|
0 / 0 |
(无) |
|
|
986 |
P1426F Number of Subsequences
|
0 / 0 |
(无) |
|
|
983 |
P1427C The Hard Work of Paparazzi
|
0 / 0 |
(无) |
|
|
982 |
P1427D Unshuffling a Deck
|
0 / 0 |
(无) |
|
|
957 |
P1431E Chess Match
|
0 / 0 |
(无) |
|
|
928 |
P1438C Engineer Artem
|
0 / 0 |
(无) |
|
|
876 |
P1451E1 Bitwise Queries (Easy Version)
|
0 / 0 |
(无) |
|
|
856 |
P1454E Number of Simple Paths
|
0 / 0 |
(无) |
|
|
845 |
P1458B Glass Half Spilled
|
0 / 0 |
(无) |
|
|
722 |
P1481D AB Graph
|
0 / 0 |
(无) |
|
|
694 |
P1487E Cheap Dinner
|
0 / 0 |
(无) |
|
|
658 |
P1493C K-beautiful Strings
|
0 / 0 |
(无) |
|
|
590 |
P1506F Triangular Paths
|
0 / 0 |
(无) |
|
|
589 |
P1506G Maximize the Remaining String
|
0 / 0 |
(无) |
|
|
551 |
P1513D GCD and MST
|
0 / 0 |
(无) |
|
|
545 |
P1514D Cut and Stick
|
0 / 0 |
(无) |
|
|
505 |
P1521C Nastia and a Hidden Permutation
|
0 / 0 |
(无) |
|
|
492 |
P1525C Robot Collisions
|
0 / 0 |
(无) |
|
|
417 |
P1536D Omkar and Medians
|
0 / 0 |
(无) |
|
|
338 |
P1551E Fixed Points
|
0 / 0 |
(无) |
|
|
292 |
P1558C Bottom-Tier Reversals
|
0 / 0 |
(无) |
|
|
260 |
P1566E Buds Re-hanging
|
0 / 0 |
(无) |
|
|
253 |
P1567D Expression Evaluation Error
|
0 / 0 |
(无) |
|
|
230 |
P1571F Kotlinforces
|
0 / 0 |
(无) |
