|
|
735 |
P1762F
Good Pairs
|
0 / 0 |
10 |
|
|
732 |
P1763B
Incinerate
|
0 / 0 |
4 |
|
|
728 |
P1763F
Edge Queries
|
0 / 0 |
10 |
|
|
718 |
P1764H
Doremy's Paint 2
|
0 / 0 |
10 |
|
|
706 |
P1765L
Project Manager
|
0 / 0 |
9 |
|
|
699 |
P1766E
Decomposition
|
0 / 0 |
8 |
|
|
696 |
P1767B
Block Towers
|
0 / 0 |
3 |
|
|
695 |
P1767C
Count Binary Strings
|
0 / 0 |
7 |
|
|
692 |
P1767F
Two Subtrees
|
0 / 0 |
10 |
|
|
682 |
P1770D
Koxia and Game
|
0 / 0 |
7 |
|
|
674 |
P1771D
Hossam and (sub-)palindromic tree
|
0 / 0 |
7 |
|
|
672 |
P1771F
Hossam and Range Minimum Query
|
0 / 0 |
9 |
|
|
654 |
P1774F1
Magician and Pigs (Easy Version)
|
0 / 0 |
9 |
|
|
653 |
P1774F2
Magician and Pigs (Hard Version)
|
0 / 0 |
10 |
|
|
652 |
P1774G
Segment Covering
|
0 / 0 |
10 |
|
|
639 |
P1776E
Crossing the Railways
|
0 / 0 |
10 |
|
|
624 |
P1777F
Comfortably Numb
|
0 / 0 |
9 |
|
|
615 |
P1779C
Least Prefix Sum
|
0 / 0 |
5 |
|
|
614 |
P1779D
Boris and His Amazing Haircut
|
0 / 0 |
5 |
|
|
606 |
P1780E
Josuke and Complete Graph
|
0 / 0 |
9 |
|
|
605 |
P1780F
Three Chairs
|
0 / 0 |
8 |
|
|
599 |
P1781E
Rectangle Shrinking
|
0 / 0 |
8 |
|
|
590 |
P1783E
Game of the Year
|
0 / 0 |
8 |
|
|
588 |
P1783G
Weighed Tree Radius
|
0 / 0 |
10 |
|
|
585 |
P1784C
Monsters (hard version)
|
0 / 0 |
8 |
|
|
572 |
P1787G
Colorful Tree Again
|
0 / 0 |
10 |
|
|
571 |
P1787H
Codeforces Scoreboard
|
0 / 0 |
10 |
|
|
570 |
P1787I
Treasure Hunt
|
0 / 0 |
10 |
|
|
565 |
P1788E
Sum Over Zero
|
0 / 0 |
8 |
|
|
554 |
P1790D
Matryoshkas
|
0 / 0 |
4 |
|
|
545 |
P1791F
Range Update Point Query
|
0 / 0 |
5 |
|
|
539 |
P1792D
Fixed Prefix Permutations
|
0 / 0 |
5 |
|
|
533 |
P1793C
Dora and Search
|
0 / 0 |
4 |
|
|
531 |
P1793E
Velepin and Marketing
|
0 / 0 |
10 |
|
|
530 |
P1793F
Rebrending
|
0 / 0 |
10 |
|
|
525 |
P1794E
Labeling the Tree with Distances
|
0 / 0 |
9 |
|
|
522 |
P1795C
Tea Tasting
|
0 / 0 |
5 |
|
|
520 |
P1795E
Explosions?
|
0 / 0 |
8 |
|
|
514 |
P1796D
Maximum Subarray
|
0 / 0 |
7 |
|
|
508 |
P1797D
Li Hua and Tree
|
0 / 0 |
6 |
|
|
507 |
P1797E
Li Hua and Array
|
0 / 0 |
8 |
|
|
506 |
P1797F
Li Hua and Path
|
0 / 0 |
10 |
|
|
504 |
P1798B
Three Sevens
|
0 / 0 |
3 |
|
|
499 |
P1799A
Recent Actions
|
0 / 0 |
3 |
|
|
495 |
P1799D2
Hot Start Up (hard version)
|
0 / 0 |
7 |
|
|
488 |
P1800C1
Powering the Hero (easy version)
|
0 / 0 |
3 |
|
|
487 |
P1800C2
Powering the Hero (hard version)
|
0 / 0 |
3 |
|
|
486 |
P1800D
Remove Two Letters
|
0 / 0 |
4 |
|
|
480 |
P1801B
Buying gifts
|
0 / 0 |
6 |
|
|
479 |
P1801C
Music Festival
|
0 / 0 |
6 |
|
|
478 |
P1801D
The way home
|
0 / 0 |
7 |
|
|
477 |
P1801E
Gasoline prices
|
0 / 0 |
10 |
|
|
475 |
P1801G
A task for substrings
|
0 / 0 |
10 |
|
|
466 |
P1804G
Flow Control
|
0 / 0 |
10 |
|
|
462 |
P1805C
Place for a Selfie
|
0 / 0 |
4 |
|
|
460 |
P1805E
There Should Be a Lot of Maximums
|
0 / 0 |
8 |
|
|
453 |
P1806E
Tree Master
|
0 / 0 |
8 |
|
|
447 |
P1807D
Odd Queries
|
0 / 0 |
3 |
|
|
444 |
P1807G1
Subsequence Addition (Easy Version)
|
0 / 0 |
3 |
|
|
439 |
P1808D
Petya, Petya, Petr, and Palindromes
|
0 / 0 |
7 |
|
|
430 |
P1809F
Traveling in Berland
|
0 / 0 |
9 |
|
|
424 |
P1810E
Monsters
|
0 / 0 |
7 |
|
|
423 |
P1810F
M-tree
|
0 / 0 |
10 |
|
|
413 |
P1811G2
Vlad and the Nice Paths (hard version)
|
0 / 0 |
8 |
|
|
399 |
P1814D
Balancing Weapons
|
0 / 0 |
9 |
|
|
398 |
P1814E
Chain Chips
|
0 / 0 |
8 |
|
|
388 |
P1817A
Almost Increasing Subsequence
|
0 / 0 |
5 |
|
|
377 |
P1819D
Misha and Apples
|
0 / 0 |
10 |
|
|
375 |
P1819F
Willy-nilly, Crack, Into Release!
|
0 / 0 |
10 |
|
|
360 |
P1822G1
Magic Triples (Easy Version)
|
0 / 0 |
5 |
|
|
359 |
P1822G2
Magic Triples (Hard Version)
|
0 / 0 |
8 |
|
|
349 |
P1824C
LuoTianyi and XOR-Tree
|
0 / 0 |
9 |
|
|
348 |
P1824D
LuoTianyi and the Function
|
0 / 0 |
10 |
|
|
347 |
P1824E
LuoTianyi and Cartridge
|
0 / 0 |
10 |
|
|
340 |
P1826E
Walk the Runway
|
0 / 0 |
9 |
|
|
336 |
P1827B2
Range Sorting (Hard Version)
|
0 / 0 |
9 |
|
|
335 |
P1827C
Palindrome Partition
|
0 / 0 |
10 |
|
|
334 |
P1827D
Two Centroids
|
0 / 0 |
10 |
|
|
332 |
P1827F
Copium Permutation
|
0 / 0 |
10 |
|
|
323 |
P1829G
Hits Different
|
0 / 0 |
5 |
|
|
317 |
P1830E
Bully Sort
|
0 / 0 |
10 |
|
|
316 |
P1830F
The Third Grace
|
0 / 0 |
10 |
|
|
301 |
P1833F
Ira and Flamenco
|
0 / 0 |
5 |
|
|
296 |
P1834D
Survey in Class
|
0 / 0 |
6 |
|
|
295 |
P1834E
MEX of LCM
|
0 / 0 |
8 |
|
|
280 |
P1837F
Editorial for Two
|
0 / 0 |
9 |
|
|
276 |
P1838D
Bracket Walk
|
0 / 0 |
7 |
|
|
270 |
P1839D
Ball Sorting
|
0 / 0 |
7 |
|
|
264 |
P1840E
Character Blocking
|
0 / 0 |
5 |
|
|
257 |
P1841D
Pairs of Segments
|
0 / 0 |
7 |
|
|
256 |
P1841E
Fill the Matrix
|
0 / 0 |
8 |
|
|
250 |
P1842E
Tenzing and Triangle
|
0 / 0 |
8 |
|
|
241 |
P1843E
Tracking Segments
|
0 / 0 |
5 |
|
|
240 |
P1843F1
Omsk Metro (simple version)
|
0 / 0 |
6 |
|
|
239 |
P1843F2
Omsk Metro (hard version)
|
0 / 0 |
8 |
|
|
232 |
P1844F2
Min Cost Permutation (Hard Version)
|
0 / 0 |
10 |
|
|
231 |
P1844G
Tree Weights
|
0 / 0 |
10 |
|
|
230 |
P1844H
Multiple of Three Cycles
|
0 / 0 |
10 |
|
|
226 |
P1845D
Rating System
|
0 / 0 |
6 |
|
|
221 |
P1846C
Rudolf and the Another Competition
|
0 / 0 |
4 |
