|
|
1847 |
P1557A
Ezzat and Two Subsequences
|
0 / 0 |
3 |
|
|
1846 |
P1557B
Moamen and k-subarrays
|
0 / 0 |
3 |
|
|
1837 |
P1558F
Strange Sort
|
0 / 0 |
10 |
|
|
1826 |
P1560E
Polycarp and String Transformation
|
0 / 0 |
6 |
|
|
1823 |
P1561A
Simply Strange Sort
|
0 / 0 |
3 |
|
|
1822 |
P1561C
Deep Down Below
|
0 / 0 |
4 |
|
|
1810 |
P1566D1
Seating Arrangements (easy version)
|
0 / 0 |
3 |
|
|
1809 |
P1566D2
Seating Arrangements (hard version)
|
0 / 0 |
5 |
|
|
1807 |
P1566F
Points Movement
|
0 / 0 |
10 |
|
|
1795 |
P1569D
Inconvenient Pairs
|
0 / 0 |
6 |
|
|
1782 |
P1572A
Book
|
0 / 0 |
6 |
|
|
1775 |
P1573B
Swaps
|
0 / 0 |
4 |
|
|
1772 |
P1574C
Slay the Dragon
|
0 / 0 |
4 |
|
|
1768 |
P1575A
Another Sorting Problem
|
0 / 0 |
3 |
|
|
1757 |
P1575L
Longest Array Deconstruction
|
0 / 0 |
7 |
|
|
1740 |
P1579B
Shifting Sort
|
0 / 0 |
3 |
|
|
1710 |
P1583H
Omkar and Tours
|
0 / 0 |
10 |
|
|
1707 |
P1584C
Two Arrays
|
0 / 0 |
3 |
|
|
1693 |
P1592A
Gamer Hemose
|
0 / 0 |
3 |
|
|
1692 |
P1592B
Hemose Shopping
|
0 / 0 |
4 |
|
|
1649 |
P1601C
Optimal Insertion
|
0 / 0 |
8 |
|
|
1648 |
P1601D
Difficult Mountain
|
0 / 0 |
10 |
|
|
1634 |
P1605B
Reverse Sort
|
0 / 0 |
3 |
|
|
1631 |
P1605E
Array Equalizer
|
0 / 0 |
9 |
|
|
1626 |
P1606D
Red-Blue Matrix
|
0 / 0 |
9 |
|
|
1621 |
P1607C
Minimum Extraction
|
0 / 0 |
3 |
|
|
1620 |
P1607D
Blue-Red Permutation
|
0 / 0 |
4 |
|
|
1616 |
P1607H
Banquet Preparations 2
|
0 / 0 |
8 |
|
|
1611 |
P1608E
The Cells on the Paper
|
0 / 0 |
10 |
|
|
1579 |
P1612E
Messages
|
0 / 0 |
7 |
|
|
1577 |
P1612G
Max Sum Array
|
0 / 0 |
9 |
|
|
1575 |
P1613B
Absent Remainder
|
0 / 0 |
3 |
|
|
1569 |
P1614B
Divan and a New Project
|
0 / 0 |
3 |
|
|
1560 |
P1615E
Purple Crayon
|
0 / 0 |
9 |
|
|
1548 |
P1617A
Forbidden Subsequence
|
0 / 0 |
3 |
|
|
1546 |
P1617C
Paprika and Permutation
|
0 / 0 |
4 |
|
|
1542 |
P1618A
Polycarp and Sums of Subsequences
|
0 / 0 |
3 |
|
|
1536 |
P1618G
Trader Problem
|
0 / 0 |
8 |
|
|
1532 |
P1619D
New Year's Problem
|
0 / 0 |
6 |
|
|
1531 |
P1619E
MEX and Increments
|
0 / 0 |
5 |
|
|
1529 |
P1619G
Unusual Minesweeper
|
0 / 0 |
7 |
|
|
1516 |
P1621E
New School
|
0 / 0 |
8 |
|
|
1510 |
P1622B
Berland Music
|
0 / 0 |
3 |
|
|
1509 |
P1622C
Set or Decrease
|
0 / 0 |
5 |
|
|
1504 |
P1623B
Game on Ranges
|
0 / 0 |
3 |
|
|
1497 |
P1624D
Palindromes Coloring
|
0 / 0 |
4 |
|
|
1492 |
P1625B
Elementary Particles
|
0 / 0 |
3 |
|
|
1490 |
P1625D
Binary Spiders
|
0 / 0 |
8 |
|
|
1487 |
P1626A
Equidistant Letters
|
0 / 0 |
3 |
|
|
1480 |
P1627B
Not Sitting
|
0 / 0 |
4 |
|
|
1469 |
P1628F
Spaceship Crisis Management
|
0 / 0 |
10 |
|
|
1468 |
P1629A
Download More RAM
|
0 / 0 |
3 |
|
|
1464 |
P1630C
Paint the Middle
|
0 / 0 |
8 |
|
|
1448 |
P1633E
Spanning Tree Queries
|
0 / 0 |
9 |
|
|
1436 |
P1635E
Cars
|
0 / 0 |
8 |
|
|
1434 |
P1637A
Sorting Parts
|
0 / 0 |
3 |
|
|
1427 |
P1637H
Minimize Inversions Number
|
0 / 0 |
10 |
|
|
1425 |
P1638B
Odd Swap Sort
|
0 / 0 |
3 |
|
|
1409 |
P1641A
Great Sequence
|
0 / 0 |
4 |
|
|
1408 |
P1641B
Repetitions Decoding
|
0 / 0 |
7 |
|
|
1407 |
P1641C
Anonymity Is Important
|
0 / 0 |
8 |
|
|
1394 |
P1646B
Quality vs Quantity
|
0 / 0 |
3 |
|
|
1383 |
P1648A
Weird Sum
|
0 / 0 |
4 |
|
|
1373 |
P1650C
Weight of the System of Nested Segments
|
0 / 0 |
4 |
|
|
1371 |
P1650E
Rescheduling the Exam
|
0 / 0 |
6 |
|
|
1362 |
P1654A
Maximum Cake Tastiness
|
0 / 0 |
3 |
|
|
1360 |
P1654C
Alice and the Cake
|
0 / 0 |
4 |
|
|
1357 |
P1654F
Minimal String Xoration
|
0 / 0 |
10 |
|
|
1354 |
P1656A
Good Pairs
|
0 / 0 |
3 |
|
|
1352 |
P1656C
Make Equal With Mod
|
0 / 0 |
4 |
|
|
1349 |
P1656F
Parametric MST
|
0 / 0 |
10 |
|
|
1342 |
P1657D
For Gamers
|
0 / 0 |
7 |
|
|
1334 |
P1658E
Gojou and Matrix Game
|
0 / 0 |
9 |
|
|
1305 |
P1662I
Ice Cream Shop
|
0 / 0 |
(无) |
|
|
1300 |
P1662N
Drone Photo
|
0 / 0 |
(无) |
|
|
1289 |
P1665B
Array Cloning Technique
|
0 / 0 |
3 |
|
|
1288 |
P1665C
Tree Infection
|
0 / 0 |
5 |
|
|
1266 |
P1668B
Social Distance
|
0 / 0 |
3 |
|
|
1264 |
P1669B
Triple
|
0 / 0 |
3 |
|
|
1257 |
P1670A
Prof
|
0 / 0 |
3 |
|
|
1250 |
P1671B
Consecutive Points Segment
|
0 / 0 |
3 |
|
|
1247 |
P1671E
Preorder
|
0 / 0 |
7 |
|
|
1226 |
P1674D
A-B-C Sort
|
0 / 0 |
4 |
|
|
1214 |
P1676B
Equal Candies
|
0 / 0 |
3 |
|
|
1211 |
P1676E
Eating Queries
|
0 / 0 |
3 |
|
|
1210 |
P1676F
Longest Strike
|
0 / 0 |
4 |
|
|
1207 |
P1676H2
Maximum Crossings (Hard Version)
|
0 / 0 |
5 |
|
|
1183 |
P1681C
Double Sort
|
0 / 0 |
4 |
|
|
1178 |
P1682B
AND Sorting
|
0 / 0 |
3 |
|
|
1175 |
P1682E
Unordered Swaps
|
0 / 0 |
10 |
|
|
1174 |
P1682F
MCMF?
|
0 / 0 |
10 |
|
|
1171 |
P1684C
Column Swapping
|
0 / 0 |
4 |
|
|
1170 |
P1684D
Traps
|
0 / 0 |
5 |
|
|
1165 |
P1685A
Circular Local MiniMax
|
0 / 0 |
3 |
|
|
1164 |
P1685B
Linguistics
|
0 / 0 |
7 |
|
|
1156 |
P1687B
Railway System
|
0 / 0 |
5 |
|
|
1155 |
P1687C
Sanae and Giant Robot
|
0 / 0 |
9 |
|
|
1150 |
P1688B
Patchouli's Magical Talisman
|
0 / 0 |
3 |
|
|
1148 |
P1689A
Lex String
|
0 / 0 |
3 |
|
|
1137 |
P1690G
Count the Trains
|
0 / 0 |
7 |
