|
549 |
P1762F Good Pairs
|
0 / 0 |
10 |
|
544 |
P1763B Incinerate
|
1 / 1 |
4 |
|
535 |
P1763F Edge Queries
|
0 / 0 |
10 |
|
518 |
P1764H Doremy's Paint 2
|
0 / 0 |
10 |
|
496 |
P1765L Project Manager
|
0 / 0 |
9 |
|
482 |
P1766E Decomposition
|
0 / 0 |
8 |
|
478 |
P1767B Block Towers
|
0 / 0 |
3 |
|
477 |
P1767C Count Binary Strings
|
0 / 0 |
7 |
|
474 |
P1767F Two Subtrees
|
0 / 0 |
10 |
|
458 |
P1770D Koxia and Game
|
0 / 0 |
7 |
|
441 |
P1771D Hossam and (sub-)palindromic tree
|
0 / 0 |
7 |
|
438 |
P1771F Hossam and Range Minimum Query
|
0 / 0 |
9 |
|
411 |
P1774F1 Magician and Pigs (Easy Version)
|
0 / 0 |
9 |
|
410 |
P1774F2 Magician and Pigs (Hard Version)
|
0 / 0 |
10 |
|
407 |
P1774G Segment Covering
|
0 / 0 |
10 |
|
390 |
P1776E Crossing the Railways
|
0 / 0 |
10 |
|
367 |
P1777F Comfortably Numb
|
0 / 0 |
9 |
|
353 |
P1779C Least Prefix Sum
|
0 / 0 |
5 |
|
352 |
P1779D Boris and His Amazing Haircut
|
0 / 0 |
5 |
|
338 |
P1780E Josuke and Complete Graph
|
0 / 0 |
9 |
|
339 |
P1780F Three Chairs
|
0 / 0 |
8 |
|
330 |
P1781E Rectangle Shrinking
|
0 / 0 |
8 |
|
316 |
P1783E Game of the Year
|
0 / 0 |
8 |
|
314 |
P1783G Weighed Tree Radius
|
0 / 0 |
10 |
|
311 |
P1784C Monsters (hard version)
|
0 / 0 |
8 |
|
295 |
P1787G Colorful Tree Again
|
0 / 0 |
10 |
|
293 |
P1787H Codeforces Scoreboard
|
0 / 0 |
10 |
|
292 |
P1787I Treasure Hunt
|
0 / 0 |
10 |
|
285 |
P1788E Sum Over Zero
|
0 / 0 |
8 |
|
272 |
P1790D Matryoshkas
|
0 / 0 |
4 |
|
261 |
P1791F Range Update Point Query
|
0 / 0 |
5 |
|
252 |
P1792D Fixed Prefix Permutations
|
0 / 0 |
5 |
|
244 |
P1793C Dora and Search
|
0 / 0 |
4 |
|
241 |
P1793E Velepin and Marketing
|
0 / 0 |
10 |
|
239 |
P1793F Rebrending
|
0 / 0 |
10 |
|
231 |
P1794E Labeling the Tree with Distances
|
0 / 0 |
9 |
|
227 |
P1795C Tea Tasting
|
0 / 0 |
5 |
|
224 |
P1795E Explosions?
|
0 / 0 |
8 |
|
215 |
P1796D Maximum Subarray
|
0 / 0 |
7 |
|
206 |
P1797D Li Hua and Tree
|
0 / 0 |
6 |
|
204 |
P1797E Li Hua and Array
|
0 / 0 |
8 |
|
203 |
P1797F Li Hua and Path
|
0 / 0 |
10 |
|
199 |
P1798B Three Sevens
|
0 / 0 |
3 |
|
192 |
P1799A Recent Actions
|
0 / 0 |
3 |
|
186 |
P1799D2 Hot Start Up (hard version)
|
0 / 0 |
7 |
|
175 |
P1800C1 Powering the Hero (easy version)
|
0 / 0 |
3 |
|
174 |
P1800C2 Powering the Hero (hard version)
|
0 / 0 |
3 |
|
172 |
P1800D Remove Two Letters
|
0 / 0 |
4 |
|
163 |
P1801B Buying gifts
|
0 / 0 |
6 |
|
162 |
P1801C Music Festival
|
0 / 0 |
6 |
|
160 |
P1801D The way home
|
0 / 0 |
7 |
|
159 |
P1801E Gasoline prices
|
0 / 0 |
10 |
|
155 |
P1801G A task for substrings
|
0 / 0 |
10 |
|
143 |
P1804G Flow Control
|
0 / 0 |
10 |
|
139 |
P1805C Place for a Selfie
|
0 / 0 |
4 |
|
137 |
P1805E There Should Be a Lot of Maximums
|
0 / 0 |
8 |
|
128 |
P1806E Tree Master
|
0 / 0 |
8 |
|
120 |
P1807D Odd Queries
|
0 / 0 |
3 |
|
114 |
P1807G1 Subsequence Addition (Easy Version)
|
0 / 0 |
3 |
|
106 |
P1808D Petya, Petya, Petr, and Palindromes
|
0 / 0 |
7 |
|
86 |
P1809F Traveling in Berland
|
0 / 0 |
9 |
|
77 |
P1810E Monsters
|
0 / 0 |
7 |
|
75 |
P1810F M-tree
|
0 / 0 |
10 |
|
60 |
P1811G2 Vlad and the Nice Paths (hard version)
|
0 / 0 |
8 |
|
53 |
P1814D Balancing Weapons
|
0 / 0 |
9 |
|
51 |
P1814E Chain Chips
|
0 / 0 |
8 |
|
9802 |
P1817A Almost Increasing Subsequence
|
0 / 0 |
5 |
|
32 |
P1819D Misha and Apples
|
0 / 0 |
10 |
|
30 |
P1819F Willy-nilly, Crack, Into Release!
|
0 / 0 |
10 |
|
9791 |
P1824C LuoTianyi and XOR-Tree
|
0 / 0 |
(None) |
|
9790 |
P1824D LuoTianyi and the Function
|
0 / 0 |
(None) |
|
9789 |
P1824E LuoTianyi and Cartridge
|
0 / 0 |
(None) |
|
9782 |
P1826E Walk the Runway
|
0 / 0 |
(None) |
|
9821 |
P1827B2 Range Sorting (Hard Version)
|
0 / 0 |
9 |
|
9820 |
P1827C Palindrome Partition
|
0 / 0 |
10 |
|
9819 |
P1827D Two Centroids
|
0 / 0 |
10 |
|
9817 |
P1827F Copium Permutation
|
0 / 0 |
10 |
|
9769 |
P1829G Hits Different
|
0 / 0 |
(None) |
|
9843 |
P1830E Bully Sort
|
0 / 0 |
(None) |
|
9842 |
P1830F The Third Grace
|
0 / 0 |
(None) |
|
9834 |
P1833F Ira and Flamenco
|
0 / 0 |
5 |
|
9941 |
P1834E MEX of LCM
|
0 / 0 |
8 |
|
9826 |
P1837F Editorial for Two
|
0 / 0 |
(None) |
|
9869 |
P1838D Bracket Walk
|
0 / 0 |
7 |
|
9863 |
P1839D Ball Sorting
|
0 / 0 |
7 |
|
9857 |
P1840E Character Blocking
|
0 / 0 |
5 |
|
9850 |
P1841D Pairs of Segments
|
0 / 1 |
10 |
|
9849 |
P1841E Fill the Matrix
|
0 / 0 |
(None) |
|
9927 |
P1842E Tenzing and Triangle
|
0 / 0 |
8 |
|
9918 |
P1843E Tracking Segments
|
0 / 0 |
5 |
|
9917 |
P1843F1 Omsk Metro (simple version)
|
0 / 0 |
6 |
|
9916 |
P1843F2 Omsk Metro (hard version)
|
0 / 0 |
8 |
|
9909 |
P1844F2 Min Cost Permutation (Hard Version)
|
0 / 0 |
10 |
|
9908 |
P1844G Tree Weights
|
0 / 0 |
10 |
|
9907 |
P1844H Multiple of Three Cycles
|
0 / 0 |
10 |
|
9903 |
P1845D Rating System
|
0 / 0 |
6 |
|
9898 |
P1846C Rudolf and the Another Competition
|
0 / 0 |
4 |
|
9889 |
P1847D Professor Higashikata
|
0 / 0 |
6 |
|
9887 |
P1847F The Boss's Identity
|
0 / 0 |
9 |
|
9885 |
P1848B Vika and the Bridge
|
0 / 0 |
4 |