|
|
2703 |
P1294F Three Paths on a Tree
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
2691 |
P1296E2 String Coloring (hard version)
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
2670 |
P1301D Time to Run
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
2646 |
P1304E 1-Trees and Queries
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
2619 |
P1311D Three Integers
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
2597 |
P1316D Nash Matrix
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
2592 |
P1320C World of Darkraft: Battle for Azathoth
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
2465 |
P1344B Monopole Magnets
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
2453 |
P1346F Dune II: Battle For Arrakis
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
2442 |
P1349B Orac and Medians
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
2441 |
P1349C Orac and Game of Life
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
2415 |
P1354C2 Not So Simple Polygon Embedding
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
2367 |
P1359D Yet Another Yet Another Task
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
2366 |
P1359E Modular Stability
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
2343 |
P1363E Tree Shuffling
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
2326 |
P1366D Two Divisors
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
2297 |
P1370D Odd-Even Subsequence
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
2255 |
P1379C Choosing flowers
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
2247 |
P1380D Berserk And Fireball
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
2222 |
P1385E Directing Edges
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
2209 |
P1388D Captain Flint and Treasure
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
2197 |
P1391D 505
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
2154 |
P1399E1 Weights Division (easy version)
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
2112 |
P1408D Searchlights
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
2084 |
P1415D XOR-gun
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
2080 |
P1416B Make Them Equal
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
2079 |
P1416C XOR Inverse
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
2013 |
P1426F Number of Subsequences
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
2010 |
P1427C The Hard Work of Paparazzi
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
2009 |
P1427D Unshuffling a Deck
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
1984 |
P1431E Chess Match
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
1955 |
P1438C Engineer Artem
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
1903 |
P1451E1 Bitwise Queries (Easy Version)
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
1883 |
P1454E Number of Simple Paths
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
1872 |
P1458B Glass Half Spilled
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
1749 |
P1481D AB Graph
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
1721 |
P1487E Cheap Dinner
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
1685 |
P1493C K-beautiful Strings
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
1617 |
P1506F Triangular Paths
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
1616 |
P1506G Maximize the Remaining String
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
1578 |
P1513D GCD and MST
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
1572 |
P1514D Cut and Stick
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
1532 |
P1521C Nastia and a Hidden Permutation
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
1519 |
P1525C Robot Collisions
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
1452 |
P1536D Omkar and Medians
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
1373 |
P1551E Fixed Points
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
1327 |
P1558C Bottom-Tier Reversals
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
1295 |
P1566E Buds Re-hanging
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
1288 |
P1567D Expression Evaluation Error
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
1274 |
P1571F Kotlinforces
|
0 / 0 |
NOI/NOI+/CTSC |
