|
|
1930 |
P1294F
Three Paths on a Tree
|
0 / 0 |
(无) |
|
|
1918 |
P1296E2
String Coloring (hard version)
|
0 / 0 |
(无) |
|
|
1897 |
P1301D
Time to Run
|
0 / 0 |
(无) |
|
|
1873 |
P1304E
1-Trees and Queries
|
0 / 0 |
(无) |
|
|
1846 |
P1311D
Three Integers
|
0 / 0 |
(无) |
|
|
1824 |
P1316D
Nash Matrix
|
0 / 0 |
(无) |
|
|
1819 |
P1320C
World of Darkraft: Battle for Azathoth
|
0 / 0 |
(无) |
|
|
1692 |
P1344B
Monopole Magnets
|
0 / 0 |
(无) |
|
|
1680 |
P1346F
Dune II: Battle For Arrakis
|
0 / 0 |
(无) |
|
|
1669 |
P1349B
Orac and Medians
|
0 / 0 |
(无) |
|
|
1668 |
P1349C
Orac and Game of Life
|
0 / 0 |
(无) |
|
|
1642 |
P1354C2
Not So Simple Polygon Embedding
|
0 / 0 |
(无) |
|
|
1594 |
P1359D
Yet Another Yet Another Task
|
0 / 0 |
(无) |
|
|
1593 |
P1359E
Modular Stability
|
0 / 0 |
(无) |
|
|
1570 |
P1363E
Tree Shuffling
|
0 / 0 |
(无) |
|
|
1553 |
P1366D
Two Divisors
|
0 / 0 |
(无) |
|
|
1524 |
P1370D
Odd-Even Subsequence
|
0 / 0 |
(无) |
|
|
1482 |
P1379C
Choosing flowers
|
0 / 0 |
(无) |
|
|
1474 |
P1380D
Berserk And Fireball
|
0 / 0 |
(无) |
|
|
1449 |
P1385E
Directing Edges
|
0 / 0 |
(无) |
|
|
1436 |
P1388D
Captain Flint and Treasure
|
0 / 0 |
(无) |
|
|
1424 |
P1391D
505
|
0 / 0 |
(无) |
|
|
1381 |
P1399E1
Weights Division (easy version)
|
0 / 0 |
(无) |
|
|
1339 |
P1408D
Searchlights
|
0 / 0 |
(无) |
|
|
1311 |
P1415D
XOR-gun
|
0 / 0 |
(无) |
|
|
1307 |
P1416B
Make Them Equal
|
0 / 0 |
(无) |
|
|
1306 |
P1416C
XOR Inverse
|
0 / 0 |
(无) |
|
|
1240 |
P1426F
Number of Subsequences
|
0 / 0 |
(无) |
|
|
1237 |
P1427C
The Hard Work of Paparazzi
|
0 / 0 |
(无) |
|
|
1236 |
P1427D
Unshuffling a Deck
|
0 / 0 |
(无) |
|
|
1211 |
P1431E
Chess Match
|
0 / 0 |
(无) |
|
|
1182 |
P1438C
Engineer Artem
|
0 / 0 |
(无) |
|
|
1130 |
P1451E1
Bitwise Queries (Easy Version)
|
0 / 0 |
(无) |
|
|
1110 |
P1454E
Number of Simple Paths
|
0 / 0 |
(无) |
|
|
1099 |
P1458B
Glass Half Spilled
|
0 / 0 |
(无) |
|
|
976 |
P1481D
AB Graph
|
0 / 0 |
(无) |
|
|
948 |
P1487E
Cheap Dinner
|
0 / 0 |
(无) |
|
|
912 |
P1493C
K-beautiful Strings
|
0 / 0 |
(无) |
|
|
844 |
P1506F
Triangular Paths
|
0 / 0 |
(无) |
|
|
843 |
P1506G
Maximize the Remaining String
|
0 / 0 |
(无) |
|
|
805 |
P1513D
GCD and MST
|
0 / 0 |
(无) |
|
|
799 |
P1514D
Cut and Stick
|
0 / 0 |
(无) |
|
|
759 |
P1521C
Nastia and a Hidden Permutation
|
0 / 0 |
(无) |
|
|
746 |
P1525C
Robot Collisions
|
0 / 0 |
(无) |
|
|
671 |
P1536D
Omkar and Medians
|
0 / 0 |
(无) |
|
|
592 |
P1551E
Fixed Points
|
0 / 0 |
(无) |
|
|
546 |
P1558C
Bottom-Tier Reversals
|
0 / 0 |
(无) |
|
|
514 |
P1566E
Buds Re-hanging
|
0 / 0 |
(无) |
|
|
507 |
P1567D
Expression Evaluation Error
|
0 / 0 |
(无) |
|
|
493 |
P1571F
Kotlinforces
|
0 / 0 |
(无) |
|
|
477 |
P1574D
The Strongest Build
|
0 / 0 |
(无) |
|
|
427 |
P1582E
Pchelyonok and Segments
|
0 / 0 |
(无) |
|
|
412 |
P1584D
Guess the Permutation
|
0 / 0 |
(无) |
|
|
368 |
P1599C
Bubble Strike
|
0 / 0 |
(无) |
|
|
303 |
P1610D
Not Quite Lee
|
0 / 0 |
(无) |
|
|
285 |
P1612E
Messages
|
0 / 0 |
(无) |
|
|
278 |
P1613E
Crazy Robot
|
0 / 0 |
(无) |
|
|
259 |
P1616D
Keep the Average High
|
0 / 0 |
(无) |
|
|
243 |
P1618F
Reverse
|
0 / 0 |
(无) |
|
|
236 |
P1619F
Let's Play the Hat?
|
0 / 0 |
(无) |
|
|
235 |
P1619G
Unusual Minesweeper
|
0 / 0 |
(无) |
|
|
230 |
P1620D
Exact Change
|
0 / 0 |
(无) |
|
|
214 |
P1622D
Shuffle
|
0 / 0 |
(无) |
|
|
202 |
P1624E
Masha-forgetful
|
0 / 0 |
(无) |
|
|
201 |
P1624F
Interacdive Problem
|
0 / 0 |
(无) |
|
|
161 |
P1632D
New Year Concert
|
0 / 0 |
(无) |
|
|
149 |
P1634D
Finding Zero
|
0 / 0 |
(无) |
|
|
129 |
P1638D
Big Brush
|
0 / 0 |
(无) |
|
|
114 |
P1641B
Repetitions Decoding
|
0 / 0 |
(无) |
|
|
98 |
P1646D
Weight the Tree
|
0 / 0 |
(无) |
|
|
48 |
P1657D
For Gamers
|
0 / 0 |
(无) |
|
|
14 |
P1665D
GCD Guess
|
0 / 0 |
(无) |
|
|
7736 |
P1672F1
Array Shuffling
|
0 / 0 |
(无) |
|
|
7721 |
P1674E
Breaking the Wall
|
0 / 0 |
(无) |
|
|
7719 |
P1674G
Remove Directed Edges
|
0 / 0 |
(无) |
|
|
7771 |
P1680E
Moving Chips
|
0 / 0 |
(无) |
|
|
7861 |
P1685B
Linguistics
|
0 / 0 |
(无) |
|
|
7834 |
P1690G
Count the Trains
|
0 / 0 |
(无) |
|
|
7932 |
P1696E
Placing Jinas
|
0 / 0 |
(无) |
|
|
7903 |
P1702G2
Passable Paths (hard version)
|
0 / 0 |
(无) |
|
|
7975 |
P1712D
Empty Graph
|
0 / 0 |
(无) |
|
|
7956 |
P1716C
Robot in a Hallway
|
0 / 0 |
(无) |
|
|
7955 |
P1716D
Chip Move
|
0 / 0 |
(无) |
|
|
8033 |
P1725C
Circular Mirror
|
0 / 0 |
(无) |
|
|
8018 |
P1726D
Edge Split
|
0 / 0 |
(无) |
|
|
8180 |
P1744F
MEX vs MED
|
0 / 0 |
7 |
|
|
8143 |
P1753C
Wish I Knew How to Sort
|
0 / 0 |
7 |
|
|
8243 |
P1763C
Another Array Problem
|
0 / 0 |
7 |
|
|
8106 |
P1764D
Doremy's Pegging Game
|
0 / 0 |
7 |
|
|
8208 |
P1772F
Copy of a Copy of a Copy
|
0 / 0 |
7 |
|
|
8372 |
P1841D
Pairs of Segments
|
0 / 0 |
7 |
|
|
8530 |
P1862G
The Great Equalizer
|
0 / 0 |
7 |
|
|
8531 |
P1862G
The Great Equalizer
|
0 / 0 |
7 |
|
|
8477 |
P1867E1
Salyg1n and Array (simple version)
|
0 / 0 |
7 |
|
|
8478 |
P1867E1
Salyg1n and Array (simple version)
|
0 / 0 |
7 |
|
|
8442 |
P1872G
Replace With Product
|
0 / 0 |
7 |
|
|
8714 |
P1900D
Small GCD
|
0 / 0 |
7 |
|
|
8694 |
P1903E
Geo Game
|
0 / 0 |
7 |
|
|
8674 |
P1906F
Maximize The Value
|
0 / 0 |
7 |
|
|
8654 |
P1910F
Build Railway Stations
|
0 / 0 |
7 |
