|
|
2314 |
P1557A
Ezzat and Two Subsequences
|
0 / 0 |
3 |
|
|
2313 |
P1557B
Moamen and k-subarrays
|
0 / 0 |
3 |
|
|
2304 |
P1558F
Strange Sort
|
0 / 0 |
10 |
|
|
2293 |
P1560E
Polycarp and String Transformation
|
0 / 0 |
6 |
|
|
2290 |
P1561A
Simply Strange Sort
|
0 / 0 |
3 |
|
|
2289 |
P1561C
Deep Down Below
|
0 / 0 |
4 |
|
|
2277 |
P1566D1
Seating Arrangements (easy version)
|
0 / 0 |
3 |
|
|
2276 |
P1566D2
Seating Arrangements (hard version)
|
0 / 0 |
5 |
|
|
2274 |
P1566F
Points Movement
|
0 / 0 |
10 |
|
|
2262 |
P1569D
Inconvenient Pairs
|
0 / 0 |
6 |
|
|
2249 |
P1572A
Book
|
0 / 0 |
6 |
|
|
2239 |
P1574C
Slay the Dragon
|
0 / 0 |
4 |
|
|
2235 |
P1575A
Another Sorting Problem
|
0 / 0 |
3 |
|
|
2224 |
P1575L
Longest Array Deconstruction
|
0 / 0 |
7 |
|
|
2207 |
P1579B
Shifting Sort
|
0 / 0 |
3 |
|
|
2177 |
P1583H
Omkar and Tours
|
0 / 0 |
10 |
|
|
2174 |
P1584C
Two Arrays
|
0 / 0 |
3 |
|
|
2160 |
P1592A
Gamer Hemose
|
0 / 0 |
3 |
|
|
2159 |
P1592B
Hemose Shopping
|
0 / 0 |
4 |
|
|
2116 |
P1601C
Optimal Insertion
|
0 / 0 |
8 |
|
|
2115 |
P1601D
Difficult Mountain
|
0 / 0 |
10 |
|
|
2101 |
P1605B
Reverse Sort
|
0 / 0 |
3 |
|
|
2098 |
P1605E
Array Equalizer
|
0 / 0 |
9 |
|
|
2093 |
P1606D
Red-Blue Matrix
|
0 / 0 |
9 |
|
|
2088 |
P1607C
Minimum Extraction
|
0 / 0 |
3 |
|
|
2087 |
P1607D
Blue-Red Permutation
|
0 / 0 |
4 |
|
|
2083 |
P1607H
Banquet Preparations 2
|
0 / 0 |
8 |
|
|
2078 |
P1608E
The Cells on the Paper
|
0 / 0 |
10 |
|
|
2046 |
P1612E
Messages
|
0 / 0 |
7 |
|
|
2044 |
P1612G
Max Sum Array
|
0 / 0 |
9 |
|
|
2042 |
P1613B
Absent Remainder
|
0 / 0 |
3 |
|
|
2036 |
P1614B
Divan and a New Project
|
0 / 0 |
3 |
|
|
2027 |
P1615E
Purple Crayon
|
0 / 0 |
9 |
|
|
2015 |
P1617A
Forbidden Subsequence
|
0 / 0 |
3 |
|
|
2013 |
P1617C
Paprika and Permutation
|
0 / 0 |
4 |
|
|
2009 |
P1618A
Polycarp and Sums of Subsequences
|
0 / 0 |
3 |
|
|
2003 |
P1618G
Trader Problem
|
0 / 0 |
8 |
|
|
1999 |
P1619D
New Year's Problem
|
0 / 0 |
6 |
|
|
1998 |
P1619E
MEX and Increments
|
0 / 0 |
5 |
|
|
1996 |
P1619G
Unusual Minesweeper
|
0 / 0 |
7 |
|
|
1983 |
P1621E
New School
|
0 / 0 |
8 |
|
|
1977 |
P1622B
Berland Music
|
0 / 0 |
3 |
|
|
1976 |
P1622C
Set or Decrease
|
0 / 0 |
5 |
|
|
1971 |
P1623B
Game on Ranges
|
0 / 0 |
3 |
|
|
1964 |
P1624D
Palindromes Coloring
|
0 / 0 |
4 |
|
|
1959 |
P1625B
Elementary Particles
|
0 / 0 |
3 |
|
|
1957 |
P1625D
Binary Spiders
|
0 / 0 |
8 |
|
|
1954 |
P1626A
Equidistant Letters
|
0 / 0 |
3 |
|
|
1947 |
P1627B
Not Sitting
|
0 / 0 |
4 |
|
|
1936 |
P1628F
Spaceship Crisis Management
|
0 / 0 |
10 |
|
|
1935 |
P1629A
Download More RAM
|
0 / 0 |
3 |
|
|
1931 |
P1630C
Paint the Middle
|
0 / 0 |
8 |
|
|
1915 |
P1633E
Spanning Tree Queries
|
0 / 0 |
9 |
|
|
1899 |
P1635E
Cars
|
0 / 0 |
8 |
|
|
1897 |
P1637A
Sorting Parts
|
0 / 0 |
3 |
|
|
1890 |
P1637H
Minimize Inversions Number
|
0 / 0 |
10 |
|
|
1886 |
P1638B
Odd Swap Sort
|
0 / 0 |
3 |
|
|
1887 |
P1638B
Odd Swap Sort
|
0 / 0 |
3 |
|
|
1867 |
P1641A
Great Sequence
|
0 / 0 |
4 |
|
|
1866 |
P1641B
Repetitions Decoding
|
0 / 0 |
7 |
|
|
1865 |
P1641C
Anonymity Is Important
|
0 / 0 |
8 |
|
|
1852 |
P1646B
Quality vs Quantity
|
0 / 0 |
3 |
|
|
1841 |
P1648A
Weird Sum
|
0 / 0 |
4 |
|
|
1831 |
P1650C
Weight of the System of Nested Segments
|
0 / 0 |
4 |
|
|
1829 |
P1650E
Rescheduling the Exam
|
0 / 0 |
6 |
|
|
1820 |
P1654A
Maximum Cake Tastiness
|
0 / 0 |
3 |
|
|
1818 |
P1654C
Alice and the Cake
|
0 / 0 |
4 |
|
|
1815 |
P1654F
Minimal String Xoration
|
0 / 0 |
10 |
|
|
1812 |
P1656A
Good Pairs
|
0 / 0 |
3 |
|
|
1810 |
P1656C
Make Equal With Mod
|
0 / 0 |
4 |
|
|
1807 |
P1656F
Parametric MST
|
0 / 0 |
10 |
|
|
1800 |
P1657D
For Gamers
|
0 / 0 |
7 |
|
|
1792 |
P1658E
Gojou and Matrix Game
|
0 / 0 |
9 |
|
|
1763 |
P1662I
Ice Cream Shop
|
0 / 0 |
(无) |
|
|
1758 |
P1662N
Drone Photo
|
0 / 0 |
(无) |
|
|
1747 |
P1665B
Array Cloning Technique
|
0 / 0 |
3 |
|
|
1746 |
P1665C
Tree Infection
|
0 / 0 |
5 |
|
|
1724 |
P1668B
Social Distance
|
0 / 0 |
3 |
|
|
1722 |
P1669B
Triple
|
0 / 0 |
3 |
|
|
1715 |
P1670A
Prof
|
0 / 0 |
3 |
|
|
1708 |
P1671B
Consecutive Points Segment
|
0 / 0 |
3 |
|
|
1705 |
P1671E
Preorder
|
0 / 0 |
7 |
|
|
1684 |
P1674D
A-B-C Sort
|
0 / 0 |
4 |
|
|
1672 |
P1676B
Equal Candies
|
0 / 0 |
3 |
|
|
1669 |
P1676E
Eating Queries
|
0 / 0 |
3 |
|
|
1668 |
P1676F
Longest Strike
|
0 / 0 |
4 |
|
|
1665 |
P1676H2
Maximum Crossings (Hard Version)
|
0 / 0 |
5 |
|
|
1641 |
P1681C
Double Sort
|
0 / 0 |
4 |
|
|
1636 |
P1682B
AND Sorting
|
0 / 0 |
3 |
|
|
1633 |
P1682E
Unordered Swaps
|
0 / 0 |
10 |
|
|
1632 |
P1682F
MCMF?
|
0 / 0 |
10 |
|
|
1629 |
P1684C
Column Swapping
|
0 / 0 |
4 |
|
|
1628 |
P1684D
Traps
|
0 / 0 |
5 |
|
|
1623 |
P1685A
Circular Local MiniMax
|
0 / 0 |
3 |
|
|
1622 |
P1685B
Linguistics
|
0 / 0 |
7 |
|
|
1614 |
P1687B
Railway System
|
0 / 0 |
5 |
|
|
1613 |
P1687C
Sanae and Giant Robot
|
0 / 0 |
9 |
|
|
1608 |
P1688B
Patchouli's Magical Talisman
|
0 / 0 |
3 |
|
|
1606 |
P1689A
Lex String
|
0 / 0 |
3 |
|
|
1595 |
P1690G
Count the Trains
|
0 / 0 |
7 |
