|
2442 |
P1294F
Three Paths on a Tree
|
0 / 0 |
7 |
|
2430 |
P1296E2
String Coloring (hard version)
|
0 / 0 |
7 |
|
2409 |
P1301D
Time to Run
|
0 / 0 |
7 |
|
2385 |
P1304E
1-Trees and Queries
|
0 / 0 |
7 |
|
2358 |
P1311D
Three Integers
|
0 / 0 |
7 |
|
2336 |
P1316D
Nash Matrix
|
0 / 0 |
7 |
|
2331 |
P1320C
World of Darkraft: Battle for Azathoth
|
0 / 0 |
7 |
|
2204 |
P1344B
Monopole Magnets
|
0 / 0 |
7 |
|
2192 |
P1346F
Dune II: Battle For Arrakis
|
0 / 0 |
7 |
|
2181 |
P1349B
Orac and Medians
|
0 / 0 |
7 |
|
2180 |
P1349C
Orac and Game of Life
|
0 / 0 |
7 |
|
2154 |
P1354C2
Not So Simple Polygon Embedding
|
0 / 0 |
7 |
|
2106 |
P1359D
Yet Another Yet Another Task
|
0 / 0 |
7 |
|
2105 |
P1359E
Modular Stability
|
0 / 0 |
7 |
|
2082 |
P1363E
Tree Shuffling
|
0 / 0 |
7 |
|
2065 |
P1366D
Two Divisors
|
0 / 0 |
7 |
|
2036 |
P1370D
Odd-Even Subsequence
|
0 / 0 |
7 |
|
1994 |
P1379C
Choosing flowers
|
0 / 0 |
7 |
|
1986 |
P1380D
Berserk And Fireball
|
0 / 0 |
7 |
|
1961 |
P1385E
Directing Edges
|
0 / 0 |
7 |
|
1948 |
P1388D
Captain Flint and Treasure
|
0 / 0 |
7 |
|
1936 |
P1391D
505
|
0 / 0 |
7 |
|
1893 |
P1399E1
Weights Division (easy version)
|
0 / 0 |
7 |
|
1851 |
P1408D
Searchlights
|
0 / 0 |
7 |
|
1823 |
P1415D
XOR-gun
|
0 / 0 |
7 |
|
1819 |
P1416B
Make Them Equal
|
0 / 0 |
7 |
|
1818 |
P1416C
XOR Inverse
|
0 / 0 |
7 |
|
1752 |
P1426F
Number of Subsequences
|
0 / 0 |
7 |
|
1749 |
P1427C
The Hard Work of Paparazzi
|
0 / 0 |
7 |
|
1748 |
P1427D
Unshuffling a Deck
|
0 / 0 |
7 |
|
1723 |
P1431E
Chess Match
|
0 / 0 |
7 |
|
1694 |
P1438C
Engineer Artem
|
0 / 0 |
7 |
|
1642 |
P1451E1
Bitwise Queries (Easy Version)
|
0 / 0 |
7 |
|
1622 |
P1454E
Number of Simple Paths
|
0 / 0 |
7 |
|
1611 |
P1458B
Glass Half Spilled
|
0 / 0 |
7 |
|
1488 |
P1481D
AB Graph
|
0 / 0 |
7 |
|
1460 |
P1487E
Cheap Dinner
|
0 / 0 |
7 |
|
1424 |
P1493C
K-beautiful Strings
|
0 / 0 |
7 |
|
1356 |
P1506F
Triangular Paths
|
0 / 0 |
7 |
|
1355 |
P1506G
Maximize the Remaining String
|
0 / 0 |
7 |
|
1317 |
P1513D
GCD and MST
|
0 / 0 |
7 |
|
1311 |
P1514D
Cut and Stick
|
0 / 0 |
7 |
|
1271 |
P1521C
Nastia and a Hidden Permutation
|
0 / 0 |
7 |
|
1258 |
P1525C
Robot Collisions
|
0 / 0 |
7 |
|
1191 |
P1536D
Omkar and Medians
|
0 / 0 |
7 |
|
1112 |
P1551E
Fixed Points
|
0 / 0 |
7 |
|
1066 |
P1558C
Bottom-Tier Reversals
|
0 / 0 |
7 |
|
1034 |
P1566E
Buds Re-hanging
|
0 / 0 |
7 |
|
1027 |
P1567D
Expression Evaluation Error
|
0 / 0 |
7 |
|
1013 |
P1571F
Kotlinforces
|
0 / 0 |
7 |
|
997 |
P1574D
The Strongest Build
|
0 / 0 |
7 |
|
947 |
P1582E
Pchelyonok and Segments
|
0 / 0 |
7 |
|
932 |
P1584D
Guess the Permutation
|
0 / 0 |
7 |
|
888 |
P1599C
Bubble Strike
|
0 / 0 |
7 |
|
823 |
P1610D
Not Quite Lee
|
0 / 0 |
7 |
|
805 |
P1612E
Messages
|
0 / 0 |
7 |
|
798 |
P1613E
Crazy Robot
|
0 / 0 |
7 |
|
779 |
P1616D
Keep the Average High
|
0 / 0 |
7 |
|
763 |
P1618F
Reverse
|
0 / 0 |
7 |
|
756 |
P1619F
Let's Play the Hat?
|
0 / 0 |
7 |
|
755 |
P1619G
Unusual Minesweeper
|
0 / 0 |
7 |
|
750 |
P1620D
Exact Change
|
0 / 0 |
7 |
|
734 |
P1622D
Shuffle
|
0 / 0 |
7 |
|
722 |
P1624E
Masha-forgetful
|
0 / 0 |
7 |
|
721 |
P1624F
Interacdive Problem
|
0 / 0 |
7 |
|
681 |
P1632D
New Year Concert
|
0 / 0 |
7 |
|
669 |
P1634D
Finding Zero
|
0 / 0 |
7 |
|
649 |
P1638D
Big Brush
|
0 / 0 |
7 |
|
634 |
P1641B
Repetitions Decoding
|
0 / 0 |
7 |
|
618 |
P1646D
Weight the Tree
|
0 / 0 |
7 |
|
568 |
P1657D
For Gamers
|
0 / 0 |
7 |
|
513 |
P1665D
GCD Guess
|
0 / 0 |
7 |
|
466 |
P1672F1
Array Shuffling
|
0 / 0 |
7 |
|
451 |
P1674E
Breaking the Wall
|
0 / 0 |
7 |
|
449 |
P1674G
Remove Directed Edges
|
0 / 0 |
7 |
|
413 |
P1680E
Moving Chips
|
0 / 0 |
7 |
|
402 |
P1682D
Circular Spanning Tree
|
0 / 0 |
7 |
|
390 |
P1685B
Linguistics
|
0 / 0 |
7 |
|
363 |
P1690G
Count the Trains
|
0 / 0 |
7 |
|
330 |
P1696E
Placing Jinas
|
0 / 0 |
7 |
|
289 |
P1702G2
Passable Paths (hard version)
|
0 / 0 |
7 |
|
236 |
P1712D
Empty Graph
|
0 / 0 |
7 |
|
211 |
P1716C
Robot in a Hallway
|
0 / 0 |
7 |
|
210 |
P1716D
Chip Move
|
0 / 0 |
7 |
|
199 |
P1718B
Fibonacci Strings
|
0 / 0 |
7 |
|
170 |
P1725C
Circular Mirror
|
0 / 0 |
7 |
|
156 |
P1726D
Edge Split
|
0 / 0 |
7 |
|
120 |
P1733D2
Zero-One (Hard Version)
|
0 / 0 |
7 |
|
65 |
P1741F
Multi-Colored Segments
|
0 / 0 |
7 |
|
43 |
P1744F
MEX vs MED
|
0 / 0 |
7 |
|
6 |
P1753C
Wish I Knew How to Sort
|
0 / 0 |
7 |
|
8220 |
P1764D
Doremy's Pegging Game
|
0 / 0 |
7 |
|
8311 |
P1770D
Koxia and Game
|
0 / 0 |
7 |
|
8399 |
P1796D
Maximum Subarray
|
0 / 0 |
7 |
|
8427 |
P1804D
Accommodation
|
0 / 0 |
7 |
|
8576 |
P1841D
Pairs of Segments
|
0 / 0 |
7 |
|
8619 |
P1857G
Counting Graphs
|
0 / 0 |
7 |
|
8685 |
P1867E1
Salyg1n and Array (simple version)
|
0 / 0 |
7 |
|
8659 |
P1872G
Replace With Product
|
0 / 0 |
7 |
|
8820 |
P1893C
Freedom of Choice
|
0 / 0 |
7 |