|
|
1194 |
P1679D
Toss a Coin to Your Graph...
|
0 / 0 |
6 |
|
|
1193 |
P1679E
Typical Party in Dorm
|
0 / 0 |
9 |
|
|
1192 |
P1679F
Formalism for Formalism
|
0 / 0 |
10 |
|
|
1187 |
P1680E
Moving Chips
|
0 / 0 |
7 |
|
|
1182 |
P1681D
Required Length
|
0 / 0 |
5 |
|
|
1181 |
P1681E
Labyrinth Adventures
|
0 / 0 |
10 |
|
|
1180 |
P1681F
Unique Occurrences
|
0 / 0 |
8 |
|
|
1158 |
P1686B
Odd Subarrays
|
0 / 0 |
3 |
|
|
1146 |
P1689C
Infected Tree
|
0 / 0 |
5 |
|
|
1145 |
P1689D
Lena and Matrix
|
0 / 0 |
6 |
|
|
1131 |
P1691F
K-Set Tree
|
0 / 0 |
9 |
|
|
1124 |
P1692G
2^Sort
|
0 / 0 |
4 |
|
|
1123 |
P1692H
Gambling
|
0 / 0 |
5 |
|
|
1121 |
P1693B
Fake Plastic Trees
|
0 / 0 |
5 |
|
|
1119 |
P1693D
Decinc Dividing
|
0 / 0 |
10 |
|
|
1112 |
P1695C
Zero Path
|
0 / 0 |
5 |
|
|
1111 |
P1695D1
Tree Queries (Easy Version)
|
0 / 0 |
8 |
|
|
1110 |
P1695D2
Tree Queries (Hard Version)
|
0 / 0 |
8 |
|
|
1101 |
P1696H
Maximum Product?
|
0 / 0 |
10 |
|
|
1096 |
P1697E
Coloring
|
0 / 0 |
9 |
|
|
1084 |
P1699D
Almost Triple Deletions
|
0 / 0 |
8 |
|
|
1083 |
P1699E
Three Days Grace
|
0 / 0 |
10 |
|
|
1079 |
P1700D
River Locks
|
0 / 0 |
6 |
|
|
1077 |
P1700F
Puzzle
|
0 / 0 |
10 |
|
|
1072 |
P1701E
Text Editor
|
0 / 0 |
9 |
|
|
1057 |
P1703F
Yet Another Problem About Pairs Satisfying an Inequality
|
0 / 0 |
4 |
|
|
1056 |
P1703G
Good Key, Bad Key
|
0 / 0 |
5 |
|
|
1051 |
P1704E
Count Seconds
|
0 / 0 |
8 |
|
|
1050 |
P1704F
Colouring Game
|
0 / 0 |
10 |
|
|
1048 |
P1704H1
Game of AI (easy version)
|
0 / 0 |
10 |
|
|
1039 |
P1706B
Making Towers
|
0 / 0 |
3 |
|
|
1038 |
P1706C
Qpwoeirut And The City
|
0 / 0 |
4 |
|
|
1036 |
P1706D2
Chopping Carrots (Hard Version)
|
0 / 0 |
9 |
|
|
1031 |
P1707D
Partial Virtual Trees
|
0 / 0 |
10 |
|
|
1029 |
P1707F
Bugaboo
|
0 / 0 |
10 |
|
|
1025 |
P1709B
Also Try Minecraft
|
0 / 0 |
3 |
|
|
1021 |
P1709F
Multiset of Strings
|
0 / 0 |
9 |
|
|
1018 |
P1710C
XOR Triangle
|
0 / 0 |
9 |
|
|
1004 |
P1713C
Build Permutation
|
0 / 0 |
4 |
|
|
1001 |
P1713F
Lost Array
|
0 / 0 |
10 |
|
|
997 |
P1714D
Color with Occurrences
|
0 / 0 |
5 |
|
|
989 |
P1715E
Long Way Home
|
0 / 0 |
9 |
|
|
985 |
P1716C
Robot in a Hallway
|
0 / 0 |
7 |
|
|
984 |
P1716D
Chip Move
|
0 / 0 |
7 |
|
|
983 |
P1716E
Swap and Maximum Block
|
0 / 0 |
9 |
|
|
982 |
P1716F
Bags with Balls
|
0 / 0 |
9 |
|
|
975 |
P1718A1
Burenka and Traditions (easy version)
|
0 / 0 |
6 |
|
|
974 |
P1718A2
Burenka and Traditions (hard version)
|
0 / 0 |
6 |
|
|
962 |
P1720D1
Xor-Subsequence (easy version)
|
0 / 0 |
6 |
|
|
961 |
P1720D2
Xor-Subsequence (hard version)
|
0 / 0 |
9 |
|
|
955 |
P1721E
Prefix Function Queries
|
0 / 0 |
8 |
|
|
949 |
P1722E
Counting Rectangles
|
0 / 0 |
5 |
|
|
942 |
P1725E
Electrical Efficiency
|
0 / 0 |
9 |
|
|
937 |
P1725J
Journey
|
0 / 0 |
9 |
|
|
934 |
P1725M
Moving Both Hands
|
0 / 0 |
6 |
|
|
922 |
P1728D
Letter Picking
|
0 / 0 |
6 |
|
|
919 |
P1728G
Illumination
|
0 / 0 |
10 |
|
|
912 |
P1729G
Cut Substrings
|
0 / 0 |
7 |
|
|
906 |
P1730F
Almost Sorted
|
0 / 0 |
10 |
|
|
902 |
P1731D
Valiant's New Map
|
0 / 0 |
5 |
|
|
901 |
P1731E
Graph Cost
|
0 / 0 |
7 |
|
|
900 |
P1731F
Function Sum
|
0 / 0 |
9 |
|
|
898 |
P1732B
Ugu
|
0 / 0 |
3 |
|
|
893 |
P1732E
Location
|
0 / 0 |
10 |
|
|
888 |
P1733D2
Zero-One (Hard Version)
|
0 / 0 |
7 |
|
|
887 |
P1733E
Conveyor
|
0 / 0 |
10 |
|
|
883 |
P1734D
Slime Escape
|
0 / 0 |
6 |
|
|
881 |
P1734F
Zeros and Ones
|
0 / 0 |
9 |
|
|
871 |
P1736C2
Good Subarrays (Hard Version)
|
0 / 0 |
9 |
|
|
869 |
P1736E
Swap and Take
|
0 / 0 |
10 |
|
|
865 |
P1737D
Ela and the Wiring Wizard
|
0 / 0 |
8 |
|
|
864 |
P1737E
Ela Goes Hiking
|
0 / 0 |
9 |
|
|
859 |
P1738C
Even Number Addicts
|
0 / 0 |
5 |
|
|
857 |
P1738E
Balance Addicts
|
0 / 0 |
8 |
|
|
855 |
P1738G
Anti-Increasing Addicts
|
0 / 0 |
10 |
|
|
851 |
P1739C
Card Game
|
0 / 0 |
5 |
|
|
849 |
P1739E
Cleaning Robot
|
0 / 0 |
9 |
|
|
848 |
P1739F
Keyboard Design
|
0 / 0 |
10 |
|
|
843 |
P1740E
Hanging Hearts
|
0 / 0 |
6 |
|
|
842 |
P1740F
Conditional Mix
|
0 / 0 |
10 |
|
|
839 |
P1740I
Arranging Crystal Balls
|
0 / 0 |
10 |
|
|
834 |
P1741E
Sending a Sequence Over the Network
|
0 / 0 |
5 |
|
|
832 |
P1741G
Kirill and Company
|
0 / 0 |
8 |
|
|
822 |
P1743C
Save the Magazines
|
0 / 0 |
3 |
|
|
821 |
P1743D
Problem with Random Tests
|
0 / 0 |
5 |
|
|
820 |
P1743E
FTL
|
0 / 0 |
9 |
|
|
819 |
P1743F
Intersection and Union
|
0 / 0 |
8 |
|
|
818 |
P1743G
Antifibonacci Cut
|
0 / 0 |
10 |
|
|
807 |
P1746D
Paths on the Tree
|
0 / 0 |
6 |
|
|
805 |
P1746E2
Joking (Hard Version)
|
0 / 0 |
10 |
|
|
803 |
P1746G
Olympiad Training
|
0 / 0 |
10 |
|
|
798 |
P1747E
List Generation
|
0 / 0 |
10 |
|
|
795 |
P1748C
Zero-Sum Prefixes
|
0 / 0 |
5 |
|
|
793 |
P1748E
Yet Another Array Counting Problem
|
0 / 0 |
8 |
|
|
788 |
P1749D
Counting Arrays
|
0 / 0 |
6 |
|
|
781 |
P1750E
Bracket Cost
|
0 / 0 |
9 |
|
|
780 |
P1750F
Majority
|
0 / 0 |
10 |
|
|
779 |
P1750G
Doping
|
0 / 0 |
10 |
|
|
778 |
P1750H
BinaryStringForces
|
0 / 0 |
10 |
|
|
777 |
P1753A1
Make Nonzero Sum (easy version)
|
0 / 0 |
4 |
