|
|
2581 |
P1475D
Cleaning the Phone
|
0 / 0 |
6 |
|
|
2564 |
P1476G
Minimum Difference
|
0 / 0 |
10 |
|
|
2491 |
P1487E
Cheap Dinner
|
0 / 0 |
7 |
|
|
2438 |
P1492C
Maximum width
|
0 / 0 |
5 |
|
|
2432 |
P1493D
GCD of an Array
|
1 / 2 |
7 |
|
|
2431 |
P1493E
Enormous XOR
|
0 / 0 |
10 |
|
|
2424 |
P1494C
1D Sokoban
|
0 / 0 |
6 |
|
|
2396 |
P1497E1
Square-Free Division (easy version)
|
0 / 0 |
5 |
|
|
2394 |
P1497E2
Square-Free Division (hard version)
|
0 / 0 |
9 |
|
|
2368 |
P1500C
Matrix Sorting
|
0 / 0 |
10 |
|
|
2366 |
P1500D
Tiles for Bathroom
|
0 / 0 |
10 |
|
|
2354 |
P1503C
Travelling Salesman Problem
|
0 / 0 |
8 |
|
|
2353 |
P1503D
Flip the Cards
|
0 / 0 |
10 |
|
|
2327 |
P1508A
Binary Literature
|
0 / 0 |
6 |
|
|
2289 |
P1511G
Chips on a Board
|
0 / 20 |
10 |
|
|
2264 |
P1514E
Baby Ehab's Hyper Apartment
|
0 / 0 |
10 |
|
|
2260 |
P1515D
Phoenix and Socks
|
0 / 0 |
5 |
|
|
2245 |
P1516D
Cut
|
0 / 0 |
7 |
|
|
2232 |
P1517E
Group Photo
|
0 / 0 |
9 |
|
|
2225 |
P1519D
Maximum Sum of Products
|
0 / 0 |
5 |
|
|
2190 |
P1525E
Assimilation IV
|
0 / 0 |
7 |
|
|
2107 |
P1535C
Unstable String
|
0 / 0 |
4 |
|
|
2087 |
P1537E1
Erase and Extend (Easy Version)
|
0 / 0 |
5 |
|
|
2086 |
P1537E2
Erase and Extend (Hard Version)
|
0 / 0 |
8 |
|
|
2082 |
P1538C
Number of Pairs
|
0 / 0 |
4 |
|
|
2074 |
P1539D
PriceFixed
|
0 / 0 |
5 |
|
|
2039 |
P1547C
Pair Programming
|
0 / 0 |
3 |
|
|
2036 |
P1547E
Air Conditioners
|
0 / 0 |
5 |
|
|
2035 |
P1547F
Array Stabilization (GCD version)
|
0 / 0 |
6 |
|
|
2028 |
P1548B
Integers Have Friends
|
0 / 0 |
6 |
|
|
2013 |
P1550D
Excellent Arrays
|
0 / 0 |
8 |
|
|
2011 |
P1550E
Stringforces
|
0 / 0 |
9 |
|
|
1967 |
P1553D
Backspace
|
0 / 0 |
5 |
|
|
1943 |
P1555E
Boring Segments
|
0 / 0 |
7 |
|
|
1935 |
P1556G
Gates to Another World
|
0 / 0 |
10 |
|
|
1926 |
P1558B
Up the Strip
|
0 / 0 |
6 |
|
|
1917 |
P1559D2
Mocha and Diana (Hard Version)
|
0 / 0 |
9 |
|
|
1890 |
P1566D2
Seating Arrangements (hard version)
|
0 / 0 |
5 |
|
|
1863 |
P1569D
Inconvenient Pairs
|
0 / 0 |
6 |
|
|
1837 |
P1572B
Xor of 3
|
0 / 0 |
9 |
|
|
1755 |
P1582C
Grandma Capa Knits a Scarf
|
0 / 0 |
4 |
|
|
1750 |
P1582F2
Korney Korneevich and XOR (hard version)
|
0 / 0 |
9 |
|
|
1708 |
P1588F
Jumping Through the Array
|
0 / 0 |
10 |
|
|
1703 |
P1592E
Bored Bakry
|
0 / 0 |
9 |
|
|
1673 |
P1598C
Delete Two Elements
|
0 / 0 |
4 |
|
|
1663 |
P1599A
Weights
|
0 / 0 |
10 |
|
|
1649 |
P1600E
Array Game
|
0 / 0 |
6 |
|
|
1642 |
P1601B
Frog Traveler
|
0 / 0 |
6 |
|
|
1619 |
P1605E
Array Equalizer
|
0 / 0 |
9 |
|
|
1598 |
P1607H
Banquet Preparations 2
|
0 / 0 |
8 |
|
|
1592 |
P1608C
Game Master
|
0 / 0 |
5 |
|
|
1578 |
P1609C
Complex Market Analysis
|
0 / 0 |
4 |
|
|
1574 |
P1609F
Interesting Sections
|
0 / 0 |
10 |
|
|
1570 |
P1610B
Kalindrome Array
|
0 / 0 |
3 |
|
|
1558 |
P1611E1
Escape The Maze (easy version)
|
0 / 0 |
5 |
|
|
1556 |
P1611F
ATM and Students
|
0 / 0 |
6 |
|
|
1499 |
P1619H
Permutation and Queries
|
0 / 0 |
9 |
|
|
1479 |
P1622D
Shuffle
|
0 / 0 |
7 |
|
|
1456 |
P1626C
Monsters And Spells
|
0 / 0 |
5 |
|
|
1446 |
P1627E
Not Escaping
|
0 / 0 |
8 |
|
|
1441 |
P1628A
Meximum Array
|
0 / 0 |
4 |
|
|
1421 |
P1630B
Range and Partition
|
0 / 0 |
6 |
|
|
1419 |
P1630C
Paint the Middle
|
0 / 0 |
8 |
|
|
1404 |
P1632D
New Year Concert
|
0 / 0 |
7 |
|
|
1370 |
P1638F
Two Posters
|
0 / 0 |
10 |
|
|
1355 |
P1641D
Two Arrays
|
0 / 1 |
10 |
|
|
1343 |
P1646B
Quality vs Quantity
|
0 / 0 |
3 |
|
|
1302 |
P1656B
Subtract Operation
|
0 / 0 |
3 |
|
|
1278 |
P1659D
Reverse Sort Sum
|
0 / 0 |
6 |
|
|
1272 |
P1660D
Maximum Product Strikes Back
|
0 / 0 |
5 |
|
|
1235 |
P1665E
MinimizOR
|
0 / 0 |
9 |
|
|
1209 |
P1669F
Eating Candies
|
0 / 0 |
3 |
|
|
1191 |
P1672D
Cyclic Rotation
|
0 / 0 |
5 |
|
|
1159 |
P1676F
Longest Strike
|
0 / 0 |
4 |
|
|
1138 |
P1680C
Binary String
|
1 / 1 |
5 |
|
|
1123 |
P1682F
MCMF?
|
0 / 0 |
10 |
|
|
1118 |
P1684E
MEX vs DIFF
|
0 / 0 |
7 |
|
|
1117 |
P1684F
Diverse Segments
|
0 / 0 |
10 |
|
|
1078 |
P1689A
Lex String
|
0 / 0 |
3 |
|
|
1065 |
P1690D
Black and White Stripe
|
0 / 0 |
3 |
|
|
1064 |
P1690E
Price Maximization
|
0 / 0 |
5 |
|
|
1060 |
P1691B
Shoe Shuffling
|
0 / 0 |
3 |
|
|
1058 |
P1691D
Max GEQ Sum
|
0 / 0 |
6 |
|
|
1051 |
P1692E
Binary Deque
|
0 / 0 |
4 |
|
|
1049 |
P1692G
2^Sort
|
0 / 0 |
4 |
|
|
1042 |
P1693F
I Might Be Wrong
|
0 / 0 |
10 |
|
|
1016 |
P1696H
Maximum Product?
|
0 / 0 |
10 |
|
|
1010 |
P1697C
awoo's Favorite Problem
|
0 / 0 |
4 |
|
|
993 |
P1698E
PermutationForces II
|
0 / 0 |
8 |
|
|
982 |
P1699E
Three Days Grace
|
0 / 0 |
10 |
|
|
973 |
P1701C
Schedule Management
|
0 / 0 |
4 |
|
|
972 |
P1701D
Permutation Restoration
|
0 / 0 |
6 |
|
|
935 |
P1706D2
Chopping Carrots (Hard Version)
|
0 / 0 |
9 |
|
|
908 |
P1712E1
LCM Sum (easy version)
|
0 / 0 |
8 |
|
|
907 |
P1712E2
LCM Sum (hard version)
|
0 / 0 |
9 |
|
|
865 |
P1719C
Fighting Tournament
|
0 / 0 |
4 |
|
|
861 |
P1720D1
Xor-Subsequence (easy version)
|
0 / 0 |
6 |
|
|
856 |
P1721C
Min-Max Array Transformation
|
0 / 0 |
4 |
|
|
843 |
P1725C
Circular Mirror
|
0 / 0 |
7 |
|
|
821 |
P1728D
Letter Picking
|
0 / 0 |
6 |