|
1519 |
P1475D
Cleaning the Phone
|
0 / 0 |
6 |
|
1509 |
P1476G
Minimum Difference
|
0 / 0 |
10 |
|
1460 |
P1487E
Cheap Dinner
|
0 / 0 |
7 |
|
1429 |
P1492C
Maximum width
|
0 / 0 |
5 |
|
1423 |
P1493D
GCD of an Array
|
0 / 0 |
7 |
|
1422 |
P1493E
Enormous XOR
|
0 / 0 |
10 |
|
1418 |
P1494C
1D Sokoban
|
0 / 0 |
6 |
|
1401 |
P1497E1
Square-Free Division (easy version)
|
0 / 0 |
5 |
|
1400 |
P1497E2
Square-Free Division (hard version)
|
0 / 0 |
9 |
|
1384 |
P1500C
Matrix Sorting
|
0 / 0 |
10 |
|
1383 |
P1500D
Tiles for Bathroom
|
0 / 0 |
10 |
|
1376 |
P1503C
Travelling Salesman Problem
|
0 / 0 |
8 |
|
1375 |
P1503D
Flip the Cards
|
0 / 0 |
10 |
|
1354 |
P1508A
Binary Literature
|
0 / 0 |
6 |
|
1328 |
P1511G
Chips on a Board
|
0 / 0 |
10 |
|
1310 |
P1514E
Baby Ehab's Hyper Apartment
|
0 / 0 |
10 |
|
1306 |
P1515D
Phoenix and Socks
|
0 / 0 |
5 |
|
1297 |
P1516D
Cut
|
0 / 0 |
7 |
|
1291 |
P1517E
Group Photo
|
0 / 0 |
9 |
|
1284 |
P1519D
Maximum Sum of Products
|
0 / 0 |
5 |
|
1256 |
P1525E
Assimilation IV
|
0 / 0 |
7 |
|
1198 |
P1535C
Unstable String
|
0 / 0 |
4 |
|
1184 |
P1537E1
Erase and Extend (Easy Version)
|
0 / 0 |
5 |
|
1183 |
P1537E2
Erase and Extend (Hard Version)
|
0 / 0 |
8 |
|
1179 |
P1538C
Number of Pairs
|
0 / 0 |
4 |
|
1171 |
P1539D
PriceFixed
|
0 / 0 |
5 |
|
1137 |
P1547C
Pair Programming
|
0 / 0 |
3 |
|
1135 |
P1547E
Air Conditioners
|
0 / 0 |
5 |
|
1134 |
P1547F
Array Stabilization (GCD version)
|
0 / 0 |
6 |
|
1131 |
P1548B
Integers Have Friends
|
0 / 0 |
6 |
|
1121 |
P1550D
Excellent Arrays
|
0 / 0 |
8 |
|
1120 |
P1550E
Stringforces
|
0 / 0 |
9 |
|
1098 |
P1553D
Backspace
|
0 / 0 |
5 |
|
1083 |
P1555E
Boring Segments
|
0 / 0 |
7 |
|
1075 |
P1556G
Gates to Another World
|
0 / 0 |
10 |
|
1067 |
P1558B
Up the Strip
|
0 / 0 |
6 |
|
1058 |
P1559D2
Mocha and Diana (Hard Version)
|
0 / 0 |
9 |
|
1035 |
P1566D2
Seating Arrangements (hard version)
|
0 / 0 |
5 |
|
1021 |
P1569D
Inconvenient Pairs
|
0 / 0 |
6 |
|
1007 |
P1572B
Xor of 3
|
0 / 0 |
9 |
|
949 |
P1582C
Grandma Capa Knits a Scarf
|
0 / 0 |
4 |
|
945 |
P1582F2
Korney Korneevich and XOR (hard version)
|
0 / 0 |
9 |
|
920 |
P1588F
Jumping Through the Array
|
0 / 0 |
10 |
|
915 |
P1592E
Bored Bakry
|
0 / 0 |
9 |
|
895 |
P1598C
Delete Two Elements
|
0 / 0 |
4 |
|
890 |
P1599A
Weights
|
0 / 0 |
10 |
|
880 |
P1600E
Array Game
|
0 / 0 |
6 |
|
876 |
P1601B
Frog Traveler
|
0 / 0 |
6 |
|
857 |
P1605E
Array Equalizer
|
0 / 0 |
9 |
|
842 |
P1607H
Banquet Preparations 2
|
0 / 0 |
8 |
|
839 |
P1608C
Game Master
|
0 / 0 |
5 |
|
832 |
P1609C
Complex Market Analysis
|
0 / 0 |
4 |
|
829 |
P1609F
Interesting Sections
|
0 / 0 |
10 |
|
825 |
P1610B
Kalindrome Array
|
0 / 0 |
3 |
|
813 |
P1611E1
Escape The Maze (easy version)
|
0 / 0 |
5 |
|
811 |
P1611F
ATM and Students
|
0 / 0 |
6 |
|
754 |
P1619H
Permutation and Queries
|
0 / 0 |
9 |
|
734 |
P1622D
Shuffle
|
0 / 0 |
7 |
|
711 |
P1626C
Monsters And Spells
|
0 / 0 |
5 |
|
703 |
P1627E
Not Escaping
|
0 / 0 |
8 |
|
701 |
P1628A
Meximum Array
|
0 / 0 |
4 |
|
691 |
P1630B
Range and Partition
|
0 / 0 |
6 |
|
690 |
P1630C
Paint the Middle
|
0 / 0 |
8 |
|
681 |
P1632D
New Year Concert
|
0 / 0 |
7 |
|
647 |
P1638F
Two Posters
|
0 / 0 |
10 |
|
632 |
P1641D
Two Arrays
|
0 / 0 |
10 |
|
620 |
P1646B
Quality vs Quantity
|
0 / 0 |
3 |
|
579 |
P1656B
Subtract Operation
|
0 / 0 |
3 |
|
555 |
P1659D
Reverse Sort Sum
|
0 / 0 |
6 |
|
549 |
P1660D
Maximum Product Strikes Back
|
0 / 0 |
5 |
|
512 |
P1665E
MinimizOR
|
0 / 0 |
9 |
|
486 |
P1669F
Eating Candies
|
0 / 0 |
3 |
|
468 |
P1672D
Cyclic Rotation
|
0 / 0 |
5 |
|
436 |
P1676F
Longest Strike
|
0 / 0 |
4 |
|
415 |
P1680C
Binary String
|
0 / 0 |
5 |
|
400 |
P1682F
MCMF?
|
0 / 0 |
10 |
|
395 |
P1684E
MEX vs DIFF
|
0 / 0 |
7 |
|
394 |
P1684F
Diverse Segments
|
0 / 0 |
10 |
|
374 |
P1689A
Lex String
|
0 / 0 |
3 |
|
366 |
P1690D
Black and White Stripe
|
0 / 0 |
3 |
|
365 |
P1690E
Price Maximization
|
0 / 0 |
5 |
|
361 |
P1691B
Shoe Shuffling
|
0 / 0 |
3 |
|
359 |
P1691D
Max GEQ Sum
|
0 / 0 |
6 |
|
352 |
P1692E
Binary Deque
|
0 / 0 |
4 |
|
350 |
P1692G
2^Sort
|
0 / 0 |
4 |
|
343 |
P1693F
I Might Be Wrong
|
0 / 0 |
10 |
|
327 |
P1696H
Maximum Product?
|
0 / 0 |
10 |
|
324 |
P1697C
awoo's Favorite Problem
|
0 / 0 |
4 |
|
316 |
P1698E
PermutationForces II
|
0 / 0 |
8 |
|
309 |
P1699E
Three Days Grace
|
0 / 0 |
10 |
|
300 |
P1701C
Schedule Management
|
0 / 0 |
4 |
|
299 |
P1701D
Permutation Restoration
|
0 / 0 |
6 |
|
262 |
P1706D2
Chopping Carrots (Hard Version)
|
0 / 0 |
9 |
|
235 |
P1712E1
LCM Sum (easy version)
|
0 / 0 |
8 |
|
234 |
P1712E2
LCM Sum (hard version)
|
0 / 0 |
9 |
|
192 |
P1719C
Fighting Tournament
|
0 / 0 |
4 |
|
188 |
P1720D1
Xor-Subsequence (easy version)
|
0 / 0 |
6 |
|
183 |
P1721C
Min-Max Array Transformation
|
0 / 0 |
4 |
|
170 |
P1725C
Circular Mirror
|
0 / 0 |
7 |
|
148 |
P1728D
Letter Picking
|
0 / 0 |
6 |