|
|
3054 |
P1294F Three Paths on a Tree
|
0 / 0 |
提高
|
|
|
3042 |
P1296E2 String Coloring (hard version)
|
0 / 0 |
提高
|
|
|
3021 |
P1301D Time to Run
|
0 / 0 |
提高
|
|
|
2997 |
P1304E 1-Trees and Queries
|
0 / 0 |
提高
|
|
|
2970 |
P1311D Three Integers
|
0 / 0 |
提高
|
|
|
2948 |
P1316D Nash Matrix
|
0 / 0 |
提高
|
|
|
2943 |
P1320C World of Darkraft: Battle for Azathoth
|
0 / 0 |
提高
|
|
|
2816 |
P1344B Monopole Magnets
|
0 / 0 |
提高
|
|
|
2804 |
P1346F Dune II: Battle For Arrakis
|
0 / 0 |
提高
|
|
|
2793 |
P1349B Orac and Medians
|
0 / 0 |
提高
|
|
|
2792 |
P1349C Orac and Game of Life
|
0 / 0 |
提高
|
|
|
2766 |
P1354C2 Not So Simple Polygon Embedding
|
0 / 0 |
提高
|
|
|
2718 |
P1359D Yet Another Yet Another Task
|
0 / 0 |
提高
|
|
|
2717 |
P1359E Modular Stability
|
0 / 0 |
提高
|
|
|
2694 |
P1363E Tree Shuffling
|
0 / 0 |
提高
|
|
|
2670 |
P1366D Two Divisors
|
0 / 0 |
提高
|
|
|
2641 |
P1370D Odd-Even Subsequence
|
0 / 0 |
提高
|
|
|
2599 |
P1379C Choosing flowers
|
0 / 0 |
提高
|
|
|
2591 |
P1380D Berserk And Fireball
|
0 / 0 |
提高
|
|
|
2566 |
P1385E Directing Edges
|
0 / 0 |
提高
|
|
|
2553 |
P1388D Captain Flint and Treasure
|
0 / 0 |
提高
|
|
|
2541 |
P1391D 505
|
0 / 0 |
提高
|
|
|
2498 |
P1399E1 Weights Division (easy version)
|
0 / 0 |
提高
|
|
|
2456 |
P1408D Searchlights
|
0 / 0 |
提高
|
|
|
2428 |
P1415D XOR-gun
|
0 / 0 |
提高
|
|
|
2424 |
P1416B Make Them Equal
|
0 / 0 |
提高
|
|
|
2423 |
P1416C XOR Inverse
|
0 / 0 |
提高
|
|
|
2357 |
P1426F Number of Subsequences
|
0 / 0 |
提高
|
|
|
2354 |
P1427C The Hard Work of Paparazzi
|
0 / 0 |
提高
|
|
|
2353 |
P1427D Unshuffling a Deck
|
0 / 0 |
提高
|
|
|
2328 |
P1431E Chess Match
|
0 / 0 |
提高
|
|
|
2299 |
P1438C Engineer Artem
|
0 / 0 |
提高
|
|
|
2247 |
P1451E1 Bitwise Queries (Easy Version)
|
0 / 0 |
提高
|
|
|
2227 |
P1454E Number of Simple Paths
|
0 / 0 |
提高
|
|
|
2216 |
P1458B Glass Half Spilled
|
0 / 0 |
提高
|
|
|
2093 |
P1481D AB Graph
|
0 / 0 |
提高
|
|
|
2065 |
P1487E Cheap Dinner
|
0 / 0 |
提高
|
|
|
2029 |
P1493C K-beautiful Strings
|
0 / 0 |
提高
|
|
|
1961 |
P1506F Triangular Paths
|
0 / 0 |
提高
|
|
|
1960 |
P1506G Maximize the Remaining String
|
0 / 0 |
提高
|
|
|
1922 |
P1513D GCD and MST
|
0 / 0 |
提高
|
|
|
1916 |
P1514D Cut and Stick
|
0 / 0 |
提高
|
|
|
1876 |
P1521C Nastia and a Hidden Permutation
|
0 / 0 |
提高
|
|
|
1863 |
P1525C Robot Collisions
|
0 / 0 |
提高
|
|
|
1790 |
P1536D Omkar and Medians
|
0 / 0 |
提高
|
|
|
1711 |
P1551E Fixed Points
|
0 / 0 |
提高
|
|
|
1665 |
P1558C Bottom-Tier Reversals
|
0 / 0 |
提高
|
|
|
1633 |
P1566E Buds Re-hanging
|
0 / 0 |
提高
|
|
|
1626 |
P1567D Expression Evaluation Error
|
0 / 0 |
提高
|
|
|
1612 |
P1571F Kotlinforces
|
0 / 0 |
提高
|
|
|
1596 |
P1574D The Strongest Build
|
0 / 0 |
提高
|
|
|
1546 |
P1582E Pchelyonok and Segments
|
0 / 0 |
提高
|
|
|
1531 |
P1584D Guess the Permutation
|
0 / 0 |
提高
|
|
|
1487 |
P1599C Bubble Strike
|
0 / 0 |
提高
|
|
|
1422 |
P1610D Not Quite Lee
|
0 / 0 |
提高
|
|
|
1404 |
P1612E Messages
|
0 / 0 |
提高
|
|
|
1397 |
P1613E Crazy Robot
|
0 / 0 |
提高
|
|
|
1378 |
P1616D Keep the Average High
|
0 / 0 |
提高
|
|
|
1362 |
P1618F Reverse
|
0 / 0 |
提高
|
|
|
1355 |
P1619F Let's Play the Hat?
|
0 / 0 |
提高
|
|
|
1354 |
P1619G Unusual Minesweeper
|
0 / 0 |
提高
|
|
|
1349 |
P1620D Exact Change
|
0 / 0 |
提高
|
|
|
1333 |
P1622D Shuffle
|
0 / 0 |
提高
|
|
|
1321 |
P1624E Masha-forgetful
|
0 / 0 |
提高
|
|
|
1320 |
P1624F Interacdive Problem
|
0 / 0 |
提高
|
|
|
1280 |
P1632D New Year Concert
|
0 / 0 |
提高
|
|
|
1268 |
P1634D Finding Zero
|
0 / 0 |
提高
|
|
|
1248 |
P1638D Big Brush
|
0 / 0 |
提高
|
|
|
1233 |
P1641B Repetitions Decoding
|
0 / 0 |
提高
|
|
|
1217 |
P1646D Weight the Tree
|
0 / 0 |
提高
|
|
|
1167 |
P1657D For Gamers
|
0 / 0 |
提高
|
|
|
1112 |
P1665D GCD Guess
|
0 / 0 |
提高
|
|
|
1065 |
P1672F1 Array Shuffling
|
0 / 0 |
提高
|
|
|
1050 |
P1674E Breaking the Wall
|
0 / 0 |
提高
|
|
|
1048 |
P1674G Remove Directed Edges
|
0 / 0 |
提高
|
|
|
1012 |
P1680E Moving Chips
|
0 / 0 |
提高
|
|
|
1001 |
P1682D Circular Spanning Tree
|
0 / 0 |
提高
|
|
|
989 |
P1685B Linguistics
|
0 / 0 |
提高
|
|
|
962 |
P1690G Count the Trains
|
0 / 0 |
提高
|
|
|
929 |
P1696E Placing Jinas
|
0 / 0 |
提高
|
|
|
888 |
P1702G2 Passable Paths (hard version)
|
0 / 0 |
提高
|
|
|
835 |
P1712D Empty Graph
|
0 / 0 |
提高
|
|
|
810 |
P1716C Robot in a Hallway
|
0 / 0 |
提高
|
|
|
809 |
P1716D Chip Move
|
0 / 0 |
提高
|
|
|
798 |
P1718B Fibonacci Strings
|
0 / 0 |
提高
|
|
|
769 |
P1725C Circular Mirror
|
0 / 0 |
提高
|
|
|
755 |
P1726D Edge Split
|
0 / 0 |
提高
|
|
|
726 |
P1731E Graph Cost
|
0 / 0 |
提高
|
|
|
713 |
P1733D2 Zero-One (Hard Version)
|
0 / 0 |
提高
|
|
|
658 |
P1741F Multi-Colored Segments
|
0 / 0 |
提高
|
|
|
636 |
P1744F MEX vs MED
|
0 / 0 |
提高
|
|
|
599 |
P1753C Wish I Knew How to Sort
|
0 / 0 |
提高
|
|
|
556 |
P1763C Another Array Problem
|
0 / 0 |
提高
|
|
|
549 |
P1764D Doremy's Pegging Game
|
0 / 0 |
提高
|
|
|
507 |
P1770D Koxia and Game
|
0 / 0 |
提高
|
|
|
349 |
P1783D Different Arrays
|
0 / 0 |
提高
|
|
|
324 |
P1788D Moving Dots
|
0 / 0 |
提高
|
|
|
272 |
P1796D Maximum Subarray
|
0 / 0 |
提高
|
|
|
227 |
P1804D Accommodation
|
0 / 0 |
提高
|
|
|
163 |
P1815B Sum Graph
|
0 / 0 |
提高
|
