|
|
2760 |
P1475D
Cleaning the Phone
|
0 / 0 |
6 |
|
|
2750 |
P1476G
Minimum Difference
|
0 / 0 |
10 |
|
|
2701 |
P1487E
Cheap Dinner
|
0 / 0 |
7 |
|
|
2670 |
P1492C
Maximum width
|
0 / 0 |
5 |
|
|
2664 |
P1493D
GCD of an Array
|
0 / 0 |
7 |
|
|
2663 |
P1493E
Enormous XOR
|
0 / 0 |
10 |
|
|
2659 |
P1494C
1D Sokoban
|
0 / 0 |
6 |
|
|
2642 |
P1497E1
Square-Free Division (easy version)
|
0 / 0 |
5 |
|
|
2641 |
P1497E2
Square-Free Division (hard version)
|
0 / 0 |
9 |
|
|
2625 |
P1500C
Matrix Sorting
|
0 / 0 |
10 |
|
|
2624 |
P1500D
Tiles for Bathroom
|
0 / 0 |
10 |
|
|
2617 |
P1503C
Travelling Salesman Problem
|
0 / 0 |
8 |
|
|
2616 |
P1503D
Flip the Cards
|
0 / 0 |
10 |
|
|
2595 |
P1508A
Binary Literature
|
0 / 0 |
6 |
|
|
2569 |
P1511G
Chips on a Board
|
0 / 0 |
10 |
|
|
2551 |
P1514E
Baby Ehab's Hyper Apartment
|
0 / 0 |
10 |
|
|
2547 |
P1515D
Phoenix and Socks
|
0 / 0 |
5 |
|
|
2538 |
P1516D
Cut
|
0 / 0 |
7 |
|
|
2532 |
P1517E
Group Photo
|
0 / 0 |
9 |
|
|
2525 |
P1519D
Maximum Sum of Products
|
0 / 0 |
5 |
|
|
2497 |
P1525E
Assimilation IV
|
0 / 0 |
7 |
|
|
2439 |
P1535C
Unstable String
|
0 / 0 |
4 |
|
|
2425 |
P1537E1
Erase and Extend (Easy Version)
|
0 / 0 |
5 |
|
|
2424 |
P1537E2
Erase and Extend (Hard Version)
|
0 / 0 |
8 |
|
|
2420 |
P1538C
Number of Pairs
|
0 / 0 |
4 |
|
|
2412 |
P1539D
PriceFixed
|
0 / 0 |
5 |
|
|
2378 |
P1547C
Pair Programming
|
0 / 0 |
3 |
|
|
2376 |
P1547E
Air Conditioners
|
0 / 0 |
5 |
|
|
2375 |
P1547F
Array Stabilization (GCD version)
|
0 / 0 |
6 |
|
|
2372 |
P1548B
Integers Have Friends
|
0 / 0 |
6 |
|
|
2362 |
P1550D
Excellent Arrays
|
0 / 0 |
8 |
|
|
2361 |
P1550E
Stringforces
|
0 / 0 |
9 |
|
|
2339 |
P1553D
Backspace
|
0 / 0 |
5 |
|
|
2324 |
P1555E
Boring Segments
|
0 / 0 |
7 |
|
|
2316 |
P1556G
Gates to Another World
|
0 / 0 |
10 |
|
|
2308 |
P1558B
Up the Strip
|
0 / 0 |
6 |
|
|
2299 |
P1559D2
Mocha and Diana (Hard Version)
|
0 / 0 |
9 |
|
|
2276 |
P1566D2
Seating Arrangements (hard version)
|
0 / 0 |
5 |
|
|
2262 |
P1569D
Inconvenient Pairs
|
0 / 0 |
6 |
|
|
2248 |
P1572B
Xor of 3
|
0 / 0 |
9 |
|
|
2190 |
P1582C
Grandma Capa Knits a Scarf
|
0 / 0 |
4 |
|
|
2186 |
P1582F2
Korney Korneevich and XOR (hard version)
|
0 / 0 |
9 |
|
|
2161 |
P1588F
Jumping Through the Array
|
0 / 0 |
10 |
|
|
2156 |
P1592E
Bored Bakry
|
0 / 0 |
9 |
|
|
2136 |
P1598C
Delete Two Elements
|
0 / 0 |
4 |
|
|
2131 |
P1599A
Weights
|
0 / 0 |
10 |
|
|
2121 |
P1600E
Array Game
|
0 / 0 |
6 |
|
|
2117 |
P1601B
Frog Traveler
|
0 / 0 |
6 |
|
|
2098 |
P1605E
Array Equalizer
|
0 / 0 |
9 |
|
|
2083 |
P1607H
Banquet Preparations 2
|
0 / 0 |
8 |
|
|
2080 |
P1608C
Game Master
|
0 / 0 |
5 |
|
|
2073 |
P1609C
Complex Market Analysis
|
0 / 0 |
4 |
|
|
2070 |
P1609F
Interesting Sections
|
0 / 0 |
10 |
|
|
2066 |
P1610B
Kalindrome Array
|
0 / 0 |
3 |
|
|
2054 |
P1611E1
Escape The Maze (easy version)
|
0 / 0 |
5 |
|
|
2052 |
P1611F
ATM and Students
|
0 / 0 |
6 |
|
|
1995 |
P1619H
Permutation and Queries
|
0 / 0 |
9 |
|
|
1975 |
P1622D
Shuffle
|
0 / 0 |
7 |
|
|
1952 |
P1626C
Monsters And Spells
|
0 / 0 |
5 |
|
|
1944 |
P1627E
Not Escaping
|
0 / 0 |
8 |
|
|
1942 |
P1628A
Meximum Array
|
0 / 0 |
4 |
|
|
1932 |
P1630B
Range and Partition
|
0 / 0 |
6 |
|
|
1931 |
P1630C
Paint the Middle
|
0 / 0 |
8 |
|
|
1922 |
P1632D
New Year Concert
|
0 / 0 |
7 |
|
|
1879 |
P1638F
Two Posters
|
0 / 0 |
10 |
|
|
1864 |
P1641D
Two Arrays
|
0 / 0 |
10 |
|
|
1852 |
P1646B
Quality vs Quantity
|
0 / 0 |
3 |
|
|
1811 |
P1656B
Subtract Operation
|
0 / 0 |
3 |
|
|
1787 |
P1659D
Reverse Sort Sum
|
0 / 0 |
6 |
|
|
1781 |
P1660D
Maximum Product Strikes Back
|
0 / 0 |
5 |
|
|
1744 |
P1665E
MinimizOR
|
0 / 0 |
9 |
|
|
1718 |
P1669F
Eating Candies
|
0 / 0 |
3 |
|
|
1700 |
P1672D
Cyclic Rotation
|
0 / 0 |
5 |
|
|
1668 |
P1676F
Longest Strike
|
0 / 0 |
4 |
|
|
1647 |
P1680C
Binary String
|
0 / 0 |
5 |
|
|
1632 |
P1682F
MCMF?
|
0 / 0 |
10 |
|
|
1627 |
P1684E
MEX vs DIFF
|
0 / 0 |
7 |
|
|
1626 |
P1684F
Diverse Segments
|
0 / 0 |
10 |
|
|
1606 |
P1689A
Lex String
|
0 / 0 |
3 |
|
|
1598 |
P1690D
Black and White Stripe
|
0 / 0 |
3 |
|
|
1597 |
P1690E
Price Maximization
|
0 / 0 |
5 |
|
|
1593 |
P1691B
Shoe Shuffling
|
0 / 0 |
3 |
|
|
1591 |
P1691D
Max GEQ Sum
|
0 / 0 |
6 |
|
|
1584 |
P1692E
Binary Deque
|
0 / 0 |
4 |
|
|
1582 |
P1692G
2^Sort
|
0 / 0 |
4 |
|
|
1575 |
P1693F
I Might Be Wrong
|
0 / 0 |
10 |
|
|
1559 |
P1696H
Maximum Product?
|
0 / 0 |
10 |
|
|
1556 |
P1697C
awoo's Favorite Problem
|
0 / 0 |
4 |
|
|
1548 |
P1698E
PermutationForces II
|
0 / 0 |
8 |
|
|
1541 |
P1699E
Three Days Grace
|
0 / 0 |
10 |
|
|
1532 |
P1701C
Schedule Management
|
0 / 0 |
4 |
|
|
1531 |
P1701D
Permutation Restoration
|
0 / 0 |
6 |
|
|
1494 |
P1706D2
Chopping Carrots (Hard Version)
|
0 / 0 |
9 |
|
|
1467 |
P1712E1
LCM Sum (easy version)
|
0 / 0 |
8 |
|
|
1466 |
P1712E2
LCM Sum (hard version)
|
0 / 0 |
9 |
|
|
1424 |
P1719C
Fighting Tournament
|
0 / 0 |
4 |
|
|
1420 |
P1720D1
Xor-Subsequence (easy version)
|
0 / 0 |
6 |
|
|
1415 |
P1721C
Min-Max Array Transformation
|
0 / 0 |
4 |
|
|
1402 |
P1725C
Circular Mirror
|
0 / 0 |
7 |
|
|
1380 |
P1728D
Letter Picking
|
0 / 0 |
6 |