|
2723 |
P1294F
Three Paths on a Tree
|
0 / 0 |
7 |
|
2711 |
P1296E2
String Coloring (hard version)
|
0 / 0 |
7 |
|
2690 |
P1301D
Time to Run
|
0 / 0 |
7 |
|
2666 |
P1304E
1-Trees and Queries
|
0 / 0 |
7 |
|
2639 |
P1311D
Three Integers
|
0 / 0 |
7 |
|
2617 |
P1316D
Nash Matrix
|
0 / 0 |
7 |
|
2612 |
P1320C
World of Darkraft: Battle for Azathoth
|
0 / 0 |
7 |
|
2485 |
P1344B
Monopole Magnets
|
0 / 0 |
7 |
|
2473 |
P1346F
Dune II: Battle For Arrakis
|
0 / 0 |
7 |
|
2462 |
P1349B
Orac and Medians
|
0 / 0 |
7 |
|
2461 |
P1349C
Orac and Game of Life
|
0 / 0 |
7 |
|
2435 |
P1354C2
Not So Simple Polygon Embedding
|
0 / 0 |
7 |
|
2387 |
P1359D
Yet Another Yet Another Task
|
0 / 0 |
7 |
|
2386 |
P1359E
Modular Stability
|
0 / 0 |
7 |
|
2363 |
P1363E
Tree Shuffling
|
0 / 0 |
7 |
|
2346 |
P1366D
Two Divisors
|
0 / 0 |
7 |
|
2317 |
P1370D
Odd-Even Subsequence
|
0 / 0 |
7 |
|
2275 |
P1379C
Choosing flowers
|
0 / 0 |
7 |
|
2267 |
P1380D
Berserk And Fireball
|
0 / 0 |
7 |
|
2242 |
P1385E
Directing Edges
|
0 / 0 |
7 |
|
2229 |
P1388D
Captain Flint and Treasure
|
0 / 0 |
7 |
|
2217 |
P1391D
505
|
0 / 0 |
7 |
|
2174 |
P1399E1
Weights Division (easy version)
|
0 / 0 |
7 |
|
2132 |
P1408D
Searchlights
|
0 / 0 |
7 |
|
2104 |
P1415D
XOR-gun
|
0 / 0 |
7 |
|
2100 |
P1416B
Make Them Equal
|
0 / 0 |
7 |
|
2099 |
P1416C
XOR Inverse
|
0 / 0 |
7 |
|
2033 |
P1426F
Number of Subsequences
|
0 / 0 |
7 |
|
2030 |
P1427C
The Hard Work of Paparazzi
|
0 / 0 |
7 |
|
2029 |
P1427D
Unshuffling a Deck
|
0 / 0 |
7 |
|
2004 |
P1431E
Chess Match
|
0 / 0 |
7 |
|
1975 |
P1438C
Engineer Artem
|
0 / 0 |
7 |
|
1923 |
P1451E1
Bitwise Queries (Easy Version)
|
0 / 0 |
7 |
|
1903 |
P1454E
Number of Simple Paths
|
0 / 0 |
7 |
|
1892 |
P1458B
Glass Half Spilled
|
0 / 0 |
7 |
|
1769 |
P1481D
AB Graph
|
0 / 0 |
7 |
|
1741 |
P1487E
Cheap Dinner
|
0 / 0 |
7 |
|
1705 |
P1493C
K-beautiful Strings
|
0 / 0 |
7 |
|
1637 |
P1506F
Triangular Paths
|
0 / 0 |
7 |
|
1636 |
P1506G
Maximize the Remaining String
|
0 / 0 |
7 |
|
1598 |
P1513D
GCD and MST
|
0 / 0 |
7 |
|
1592 |
P1514D
Cut and Stick
|
0 / 0 |
7 |
|
1552 |
P1521C
Nastia and a Hidden Permutation
|
0 / 0 |
7 |
|
1539 |
P1525C
Robot Collisions
|
0 / 0 |
7 |
|
1472 |
P1536D
Omkar and Medians
|
0 / 0 |
7 |
|
1393 |
P1551E
Fixed Points
|
0 / 0 |
7 |
|
1347 |
P1558C
Bottom-Tier Reversals
|
0 / 0 |
7 |
|
1315 |
P1566E
Buds Re-hanging
|
0 / 0 |
7 |
|
1308 |
P1567D
Expression Evaluation Error
|
0 / 0 |
7 |
|
1294 |
P1571F
Kotlinforces
|
0 / 0 |
7 |
|
1278 |
P1574D
The Strongest Build
|
0 / 0 |
7 |
|
1228 |
P1582E
Pchelyonok and Segments
|
0 / 0 |
7 |
|
1213 |
P1584D
Guess the Permutation
|
0 / 0 |
7 |
|
1169 |
P1599C
Bubble Strike
|
0 / 0 |
7 |
|
1104 |
P1610D
Not Quite Lee
|
0 / 0 |
7 |
|
1086 |
P1612E
Messages
|
0 / 0 |
7 |
|
1079 |
P1613E
Crazy Robot
|
0 / 0 |
7 |
|
1060 |
P1616D
Keep the Average High
|
0 / 0 |
7 |
|
1044 |
P1618F
Reverse
|
0 / 0 |
7 |
|
1037 |
P1619F
Let's Play the Hat?
|
0 / 0 |
7 |
|
1036 |
P1619G
Unusual Minesweeper
|
0 / 0 |
7 |
|
1031 |
P1620D
Exact Change
|
0 / 0 |
7 |
|
1015 |
P1622D
Shuffle
|
0 / 0 |
7 |
|
1003 |
P1624E
Masha-forgetful
|
0 / 0 |
7 |
|
1002 |
P1624F
Interacdive Problem
|
0 / 0 |
7 |
|
962 |
P1632D
New Year Concert
|
0 / 0 |
7 |
|
950 |
P1634D
Finding Zero
|
0 / 0 |
7 |
|
930 |
P1638D
Big Brush
|
0 / 0 |
7 |
|
915 |
P1641B
Repetitions Decoding
|
0 / 0 |
7 |
|
899 |
P1646D
Weight the Tree
|
0 / 0 |
7 |
|
849 |
P1657D
For Gamers
|
0 / 0 |
7 |
|
794 |
P1665D
GCD Guess
|
0 / 0 |
7 |
|
747 |
P1672F1
Array Shuffling
|
0 / 0 |
7 |
|
732 |
P1674E
Breaking the Wall
|
0 / 0 |
7 |
|
730 |
P1674G
Remove Directed Edges
|
0 / 0 |
7 |
|
694 |
P1680E
Moving Chips
|
0 / 0 |
7 |
|
683 |
P1682D
Circular Spanning Tree
|
0 / 0 |
7 |
|
671 |
P1685B
Linguistics
|
0 / 0 |
7 |
|
644 |
P1690G
Count the Trains
|
0 / 0 |
7 |
|
611 |
P1696E
Placing Jinas
|
0 / 0 |
7 |
|
570 |
P1702G2
Passable Paths (hard version)
|
0 / 0 |
7 |
|
517 |
P1712D
Empty Graph
|
0 / 0 |
7 |
|
492 |
P1716C
Robot in a Hallway
|
0 / 0 |
7 |
|
491 |
P1716D
Chip Move
|
0 / 0 |
7 |
|
480 |
P1718B
Fibonacci Strings
|
0 / 0 |
7 |
|
451 |
P1725C
Circular Mirror
|
0 / 0 |
7 |
|
437 |
P1726D
Edge Split
|
0 / 0 |
7 |
|
408 |
P1731E
Graph Cost
|
0 / 0 |
7 |
|
395 |
P1733D2
Zero-One (Hard Version)
|
0 / 0 |
7 |
|
340 |
P1741F
Multi-Colored Segments
|
0 / 0 |
7 |
|
318 |
P1744F
MEX vs MED
|
0 / 0 |
7 |
|
281 |
P1753C
Wish I Knew How to Sort
|
0 / 0 |
7 |
|
238 |
P1763C
Another Array Problem
|
0 / 0 |
7 |
|
231 |
P1764D
Doremy's Pegging Game
|
0 / 0 |
7 |
|
189 |
P1770D
Koxia and Game
|
0 / 0 |
7 |
|
98 |
P1783D
Different Arrays
|
0 / 0 |
7 |
|
73 |
P1788D
Moving Dots
|
0 / 0 |
7 |
|
21 |
P1796D
Maximum Subarray
|
0 / 0 |
7 |
|
8542 |
P1815B
Sum Graph
|
0 / 0 |
7 |
|
8637 |
P1827B1
Range Sorting (Easy Version)
|
0 / 0 |
7 |