|
|
1221 |
P1758F
Decent Division
|
0 / 0 |
10 |
|
|
1215 |
P1759F
All Possible Digits
|
0 / 0 |
6 |
|
|
1214 |
P1759G
Restore the Permutation
|
0 / 0 |
6 |
|
|
1211 |
P1760C
Advantage
|
0 / 0 |
3 |
|
|
1209 |
P1760E
Binary Inversions
|
0 / 0 |
3 |
|
|
1193 |
P1762F
Good Pairs
|
0 / 0 |
10 |
|
|
1190 |
P1763B
Incinerate
|
0 / 0 |
4 |
|
|
1186 |
P1763F
Edge Queries
|
0 / 0 |
10 |
|
|
1176 |
P1764H
Doremy's Paint 2
|
0 / 0 |
10 |
|
|
1164 |
P1765L
Project Manager
|
0 / 0 |
9 |
|
|
1157 |
P1766E
Decomposition
|
0 / 0 |
8 |
|
|
1154 |
P1767B
Block Towers
|
0 / 0 |
3 |
|
|
1153 |
P1767C
Count Binary Strings
|
0 / 0 |
7 |
|
|
1150 |
P1767F
Two Subtrees
|
0 / 0 |
10 |
|
|
1140 |
P1770D
Koxia and Game
|
0 / 0 |
7 |
|
|
1132 |
P1771D
Hossam and (sub-)palindromic tree
|
0 / 0 |
7 |
|
|
1130 |
P1771F
Hossam and Range Minimum Query
|
0 / 0 |
9 |
|
|
1112 |
P1774F1
Magician and Pigs (Easy Version)
|
0 / 0 |
9 |
|
|
1111 |
P1774F2
Magician and Pigs (Hard Version)
|
0 / 0 |
10 |
|
|
1110 |
P1774G
Segment Covering
|
0 / 0 |
10 |
|
|
1097 |
P1776E
Crossing the Railways
|
0 / 0 |
10 |
|
|
1082 |
P1777F
Comfortably Numb
|
0 / 0 |
9 |
|
|
1073 |
P1779C
Least Prefix Sum
|
0 / 0 |
5 |
|
|
1072 |
P1779D
Boris and His Amazing Haircut
|
0 / 0 |
5 |
|
|
1064 |
P1780E
Josuke and Complete Graph
|
0 / 0 |
9 |
|
|
1063 |
P1780F
Three Chairs
|
0 / 0 |
8 |
|
|
1057 |
P1781E
Rectangle Shrinking
|
0 / 0 |
8 |
|
|
1048 |
P1783E
Game of the Year
|
0 / 0 |
8 |
|
|
1046 |
P1783G
Weighed Tree Radius
|
0 / 0 |
10 |
|
|
1043 |
P1784C
Monsters (hard version)
|
0 / 0 |
8 |
|
|
1030 |
P1787G
Colorful Tree Again
|
0 / 0 |
10 |
|
|
1029 |
P1787H
Codeforces Scoreboard
|
0 / 0 |
10 |
|
|
1028 |
P1787I
Treasure Hunt
|
0 / 0 |
10 |
|
|
1023 |
P1788E
Sum Over Zero
|
0 / 0 |
8 |
|
|
1012 |
P1790D
Matryoshkas
|
0 / 0 |
4 |
|
|
1003 |
P1791F
Range Update Point Query
|
0 / 0 |
5 |
|
|
997 |
P1792D
Fixed Prefix Permutations
|
0 / 0 |
5 |
|
|
991 |
P1793C
Dora and Search
|
0 / 0 |
4 |
|
|
989 |
P1793E
Velepin and Marketing
|
0 / 0 |
10 |
|
|
988 |
P1793F
Rebrending
|
0 / 0 |
10 |
|
|
983 |
P1794E
Labeling the Tree with Distances
|
0 / 0 |
9 |
|
|
980 |
P1795C
Tea Tasting
|
0 / 0 |
5 |
|
|
978 |
P1795E
Explosions?
|
0 / 0 |
8 |
|
|
972 |
P1796D
Maximum Subarray
|
0 / 0 |
7 |
|
|
966 |
P1797D
Li Hua and Tree
|
0 / 0 |
6 |
|
|
965 |
P1797E
Li Hua and Array
|
0 / 0 |
8 |
|
|
964 |
P1797F
Li Hua and Path
|
0 / 0 |
10 |
|
|
962 |
P1798B
Three Sevens
|
0 / 0 |
3 |
|
|
957 |
P1799A
Recent Actions
|
0 / 0 |
3 |
|
|
953 |
P1799D2
Hot Start Up (hard version)
|
0 / 0 |
7 |
|
|
946 |
P1800C1
Powering the Hero (easy version)
|
0 / 0 |
3 |
|
|
945 |
P1800C2
Powering the Hero (hard version)
|
0 / 0 |
3 |
|
|
944 |
P1800D
Remove Two Letters
|
0 / 0 |
4 |
|
|
938 |
P1801B
Buying gifts
|
0 / 0 |
6 |
|
|
937 |
P1801C
Music Festival
|
0 / 0 |
6 |
|
|
936 |
P1801D
The way home
|
0 / 0 |
7 |
|
|
935 |
P1801E
Gasoline prices
|
0 / 0 |
10 |
|
|
933 |
P1801G
A task for substrings
|
0 / 0 |
10 |
|
|
924 |
P1804G
Flow Control
|
0 / 0 |
10 |
|
|
920 |
P1805C
Place for a Selfie
|
0 / 0 |
4 |
|
|
918 |
P1805E
There Should Be a Lot of Maximums
|
0 / 0 |
8 |
|
|
911 |
P1806E
Tree Master
|
0 / 0 |
8 |
|
|
905 |
P1807D
Odd Queries
|
0 / 0 |
3 |
|
|
902 |
P1807G1
Subsequence Addition (Easy Version)
|
0 / 0 |
3 |
|
|
897 |
P1808D
Petya, Petya, Petr, and Palindromes
|
0 / 0 |
7 |
|
|
888 |
P1809F
Traveling in Berland
|
0 / 0 |
9 |
|
|
882 |
P1810E
Monsters
|
0 / 0 |
7 |
|
|
881 |
P1810F
M-tree
|
0 / 0 |
10 |
|
|
871 |
P1811G2
Vlad and the Nice Paths (hard version)
|
0 / 0 |
8 |
|
|
857 |
P1814D
Balancing Weapons
|
0 / 0 |
9 |
|
|
856 |
P1814E
Chain Chips
|
0 / 0 |
8 |
|
|
846 |
P1817A
Almost Increasing Subsequence
|
0 / 0 |
5 |
|
|
835 |
P1819D
Misha and Apples
|
0 / 0 |
10 |
|
|
833 |
P1819F
Willy-nilly, Crack, Into Release!
|
0 / 0 |
10 |
|
|
818 |
P1822G1
Magic Triples (Easy Version)
|
0 / 0 |
5 |
|
|
817 |
P1822G2
Magic Triples (Hard Version)
|
0 / 0 |
8 |
|
|
807 |
P1824C
LuoTianyi and XOR-Tree
|
0 / 0 |
9 |
|
|
806 |
P1824D
LuoTianyi and the Function
|
0 / 0 |
10 |
|
|
805 |
P1824E
LuoTianyi and Cartridge
|
0 / 0 |
10 |
|
|
798 |
P1826E
Walk the Runway
|
0 / 0 |
9 |
|
|
794 |
P1827B2
Range Sorting (Hard Version)
|
0 / 0 |
9 |
|
|
793 |
P1827C
Palindrome Partition
|
0 / 0 |
10 |
|
|
792 |
P1827D
Two Centroids
|
0 / 0 |
10 |
|
|
790 |
P1827F
Copium Permutation
|
0 / 0 |
10 |
|
|
781 |
P1829G
Hits Different
|
0 / 0 |
5 |
|
|
775 |
P1830E
Bully Sort
|
0 / 0 |
10 |
|
|
774 |
P1830F
The Third Grace
|
0 / 0 |
10 |
|
|
759 |
P1833F
Ira and Flamenco
|
0 / 0 |
5 |
|
|
754 |
P1834D
Survey in Class
|
0 / 0 |
6 |
|
|
753 |
P1834E
MEX of LCM
|
0 / 0 |
8 |
|
|
738 |
P1837F
Editorial for Two
|
0 / 0 |
9 |
|
|
734 |
P1838D
Bracket Walk
|
0 / 0 |
7 |
|
|
728 |
P1839D
Ball Sorting
|
0 / 0 |
7 |
|
|
722 |
P1840E
Character Blocking
|
0 / 0 |
5 |
|
|
715 |
P1841D
Pairs of Segments
|
0 / 0 |
7 |
|
|
714 |
P1841E
Fill the Matrix
|
0 / 0 |
8 |
|
|
708 |
P1842E
Tenzing and Triangle
|
0 / 0 |
8 |
|
|
699 |
P1843E
Tracking Segments
|
0 / 0 |
5 |
|
|
698 |
P1843F1
Omsk Metro (simple version)
|
0 / 0 |
6 |
|
|
697 |
P1843F2
Omsk Metro (hard version)
|
0 / 0 |
8 |
