|
|
2382 |
CF1560F1
Nearest Beautiful Number (easy version)
|
0 / 0 |
(None) |
|
|
2381 |
CF1560F2
Nearest Beautiful Number (hard version)
|
0 / 0 |
(None) |
|
|
2375 |
CF1562B
Scenes From a Memory
|
0 / 0 |
(None) |
|
|
2374 |
CF1562C
Rings
|
0 / 0 |
(None) |
|
|
2367 |
CF1566B
MIN-MEX Cut
|
0 / 0 |
(None) |
|
|
2366 |
CF1566C
MAX-MEX Cut
|
0 / 0 |
(None) |
|
|
2363 |
CF1566E
Buds Re-hanging
|
0 / 0 |
(None) |
|
|
2361 |
CF1566G
Four Vertices
|
0 / 0 |
(None) |
|
|
2360 |
CF1566H
Xor-quiz
|
0 / 0 |
(None) |
|
|
2355 |
CF1567D
Expression Evaluation Error
|
0 / 0 |
(None) |
|
|
2353 |
CF1567F
One-Four Overload
|
0 / 0 |
(None) |
|
|
2351 |
CF1569B
Chess Tournament
|
0 / 0 |
(None) |
|
|
2342 |
CF1571D
Sweepstake
|
0 / 0 |
(None) |
|
|
2340 |
CF1571F
Kotlinforces
|
0 / 0 |
(None) |
|
|
2333 |
CF1572B
Xor of 3
|
0 / 0 |
(None) |
|
|
2326 |
CF1574A
Regular Bracket Sequences
|
0 / 0 |
(None) |
|
|
2321 |
CF1574E
Coloring
|
0 / 0 |
(None) |
|
|
2304 |
CF1578A
Anti-Tetris
|
0 / 0 |
(None) |
|
|
2289 |
CF1578M
The Mind
|
0 / 0 |
(None) |
|
|
2285 |
CF1579D
Productive Meeting
|
0 / 0 |
(None) |
|
|
2284 |
CF1579E1
Permutation Minimization by Deque
|
0 / 0 |
(None) |
|
|
2275 |
CF1580E
Railway Construction
|
0 / 0 |
(None) |
|
|
2272 |
CF1581B
Diameter of Graph
|
0 / 0 |
(None) |
|
|
2267 |
CF1582D
Vupsen, Pupsen and 0
|
0 / 0 |
(None) |
|
|
2261 |
CF1583B
Omkar and Heavenly Tree
|
0 / 0 |
(None) |
|
|
2259 |
CF1583D
Omkar and the Meaning of Life
|
0 / 0 |
(None) |
|
|
2258 |
CF1583E
Moment of Bloom
|
0 / 0 |
(None) |
|
|
2256 |
CF1583F
Defender of Childhood Dreams
|
0 / 0 |
(None) |
|
|
2238 |
CF1586I
Omkar and Mosaic
|
0 / 0 |
(None) |
|
|
2234 |
CF1592B
Hemose Shopping
|
0 / 0 |
(None) |
|
|
2233 |
CF1592C
Bakry and Partitioning
|
0 / 0 |
(None) |
|
|
2230 |
CF1592F1
Alice and Recoloring 1
|
0 / 0 |
(None) |
|
|
2229 |
CF1592F2
Alice and Recoloring 2
|
0 / 0 |
(None) |
|
|
2220 |
CF1593G
Changing Brackets
|
0 / 0 |
(None) |
|
|
2216 |
CF1594D
The Number of Imposters
|
0 / 0 |
(None) |
|
|
2212 |
CF1594F
Ideal Farm
|
0 / 0 |
(None) |
|
|
2204 |
CF1599A
Weights
|
0 / 0 |
(None) |
|
|
2181 |
CF1602B
Divine Array
|
0 / 0 |
(None) |
|
|
2180 |
CF1603A
Di-visible Confusion
|
0 / 0 |
(None) |
|
|
2178 |
CF1603B
Moderate Modular Mode
|
0 / 0 |
(None) |
|
|
2167 |
CF1605D
Treelabeling
|
0 / 0 |
(None) |
|
|
2161 |
CF1606D
Red-Blue Matrix
|
0 / 0 |
(None) |
|
|
2149 |
CF1608A
Find Array
|
0 / 0 |
(None) |
|
|
2148 |
CF1608B
Build the Permutation
|
0 / 0 |
(None) |
|
|
2127 |
CF1610F
Mashtali: a Space Oddysey
|
0 / 0 |
(None) |
|
|
2122 |
CF1611A
Make Even
|
0 / 0 |
(None) |
|
|
2121 |
CF1611B
Team Composition: Programmers and Mathematicians
|
0 / 0 |
(None) |
|
|
2120 |
CF1611C
Polycarp Recovers the Permutation
|
0 / 0 |
(None) |
|
|
2119 |
CF1611D
Weights Assignment For Tree Edges
|
0 / 0 |
(None) |
|
|
2114 |
CF1612A
Distance
|
0 / 0 |
(None) |
|
|
2112 |
CF1612B
Special Permutation
|
0 / 0 |
(None) |
|
|
2107 |
CF1612G
Max Sum Array
|
0 / 0 |
(None) |
|
|
2099 |
CF1614A
Divan and a Store
|
0 / 0 |
(None) |
|
|
2098 |
CF1614B
Divan and a New Project
|
0 / 0 |
(None) |
|
|
2097 |
CF1614C
Divan and bitwise operations
|
0 / 0 |
(None) |
|
|
2086 |
CF1615G
Maximum Adjacent Pairs
|
0 / 0 |
(None) |
|
|
2085 |
CF1615H
Reindeer Games
|
0 / 0 |
(None) |
|
|
2074 |
CF1617A
Forbidden Subsequence
|
0 / 0 |
(None) |
|
|
2073 |
CF1617B
GCD Problem
|
0 / 0 |
(None) |
|
|
2071 |
CF1617D1
Too Many Impostors (easy version)
|
0 / 0 |
(None) |
|
|
2070 |
CF1617D2
Too Many Impostors (hard version)
|
0 / 0 |
(None) |
|
|
2063 |
CF1618E
Singers' Tour
|
0 / 0 |
(None) |
|
|
2062 |
CF1618F
Reverse
|
0 / 0 |
(None) |
|
|
2055 |
CF1619E
MEX and Increments
|
0 / 0 |
(None) |
|
|
2054 |
CF1619F
Let's Play the Hat?
|
0 / 0 |
(None) |
|
|
2051 |
CF1620A
Equal or Not Equal
|
0 / 0 |
(None) |
|
|
2048 |
CF1620D
Exact Change
|
0 / 0 |
(None) |
|
|
2047 |
CF1620E
Replace the Numbers
|
0 / 0 |
(None) |
|
|
2043 |
CF1621A
Stable Arrangement of Rooks
|
0 / 0 |
(None) |
|
|
2040 |
CF1621D
The Winter Hike
|
0 / 0 |
(None) |
|
|
2028 |
CF1622F
Quadratic Set
|
0 / 0 |
(None) |
|
|
2019 |
CF1624C
Division by Two and Permutation
|
0 / 0 |
(None) |
|
|
2017 |
CF1624E
Masha-forgetful
|
0 / 0 |
(None) |
|
|
2016 |
CF1624F
Interacdive Problem
|
0 / 0 |
(None) |
|
|
2007 |
CF1626A
Equidistant Letters
|
0 / 0 |
(None) |
|
|
2000 |
CF1627A
Not Shading
|
0 / 0 |
(None) |
|
|
1998 |
CF1627C
Not Assigning
|
0 / 0 |
(None) |
|
|
1994 |
CF1628A
Meximum Array
|
0 / 0 |
(None) |
|
|
1992 |
CF1628C
Grid Xor
|
0 / 0 |
(None) |
|
|
1984 |
CF1630A
And Matching
|
0 / 0 |
(None) |
|
|
1983 |
CF1630B
Range and Partition
|
0 / 0 |
(None) |
|
|
1981 |
CF1630D
Flipping Range
|
0 / 0 |
(None) |
|
|
1974 |
CF1632B
Roof Construction
|
0 / 0 |
(None) |
|
|
1959 |
CF1634C
OKEA
|
0 / 0 |
(None) |
|
|
1958 |
CF1634D
Finding Zero
|
0 / 0 |
(None) |
|
|
1956 |
CF1634E
Fair Share
|
0 / 0 |
(None) |
|
|
1952 |
CF1635C
Differential Sorting
|
0 / 0 |
(None) |
|
|
1950 |
CF1635E
Cars
|
0 / 0 |
(None) |
|
|
1942 |
CF1637F
Towers
|
0 / 0 |
(None) |
|
|
1941 |
CF1637G
Birthday
|
0 / 0 |
(None) |
|
|
1939 |
CF1638A
Reverse
|
0 / 0 |
(None) |
|
|
1936 |
CF1638D
Big Brush
|
0 / 0 |
(None) |
|
|
1919 |
CF1641B
Repetitions Decoding
|
0 / 0 |
(None) |
|
|
1910 |
CF1644B
Anti-Fibonacci Permutation
|
0 / 0 |
(None) |
|
|
1904 |
CF1646B
Quality vs Quantity
|
0 / 0 |
(None) |
|
|
1903 |
CF1646C
Factorials and Powers of Two
|
0 / 0 |
(None) |
|
|
1901 |
CF1646D
Weight the Tree
|
0 / 0 |
(None) |
|
|
1899 |
CF1646F
Playing Around the Table
|
0 / 0 |
(None) |
|
|
1897 |
CF1647B
Madoka and the Elegant Gift
|
0 / 0 |
(None) |
|
|
1896 |
CF1647C
Madoka and Childish Pranks
|
0 / 0 |
(None) |