|
|
1241 |
codeforces#P1679D Toss a Coin to Your Graph...
|
0 / 0 |
6 |
|
|
1240 |
codeforces#P1679E Typical Party in Dorm
|
0 / 0 |
9 |
|
|
1239 |
codeforces#P1679F Formalism for Formalism
|
0 / 0 |
10 |
|
|
1234 |
codeforces#P1680E Moving Chips
|
0 / 0 |
7 |
|
|
1229 |
codeforces#P1681D Required Length
|
0 / 0 |
5 |
|
|
1228 |
codeforces#P1681E Labyrinth Adventures
|
0 / 0 |
10 |
|
|
1227 |
codeforces#P1681F Unique Occurrences
|
0 / 0 |
8 |
|
|
1205 |
codeforces#P1686B Odd Subarrays
|
0 / 0 |
3 |
|
|
1193 |
codeforces#P1689C Infected Tree
|
0 / 0 |
5 |
|
|
1192 |
codeforces#P1689D Lena and Matrix
|
0 / 0 |
6 |
|
|
1178 |
codeforces#P1691F K-Set Tree
|
0 / 0 |
9 |
|
|
1171 |
codeforces#P1692G 2^Sort
|
0 / 0 |
4 |
|
|
1170 |
codeforces#P1692H Gambling
|
0 / 0 |
5 |
|
|
1168 |
codeforces#P1693B Fake Plastic Trees
|
0 / 0 |
5 |
|
|
1166 |
codeforces#P1693D Decinc Dividing
|
0 / 0 |
10 |
|
|
1159 |
codeforces#P1695C Zero Path
|
0 / 0 |
5 |
|
|
1158 |
codeforces#P1695D1 Tree Queries (Easy Version)
|
0 / 0 |
8 |
|
|
1157 |
codeforces#P1695D2 Tree Queries (Hard Version)
|
0 / 0 |
8 |
|
|
1148 |
codeforces#P1696H Maximum Product?
|
0 / 0 |
10 |
|
|
1143 |
codeforces#P1697E Coloring
|
0 / 0 |
9 |
|
|
1131 |
codeforces#P1699D Almost Triple Deletions
|
0 / 0 |
8 |
|
|
1130 |
codeforces#P1699E Three Days Grace
|
0 / 0 |
10 |
|
|
1126 |
codeforces#P1700D River Locks
|
0 / 0 |
6 |
|
|
1124 |
codeforces#P1700F Puzzle
|
0 / 0 |
10 |
|
|
1119 |
codeforces#P1701E Text Editor
|
0 / 0 |
9 |
|
|
1104 |
codeforces#P1703F Yet Another Problem About Pairs Satisfying an Inequality
|
0 / 0 |
4 |
|
|
1103 |
codeforces#P1703G Good Key, Bad Key
|
0 / 0 |
5 |
|
|
1098 |
codeforces#P1704E Count Seconds
|
0 / 0 |
8 |
|
|
1097 |
codeforces#P1704F Colouring Game
|
0 / 0 |
10 |
|
|
1095 |
codeforces#P1704H1 Game of AI (easy version)
|
0 / 0 |
10 |
|
|
1086 |
codeforces#P1706B Making Towers
|
0 / 0 |
3 |
|
|
1085 |
codeforces#P1706C Qpwoeirut And The City
|
0 / 0 |
4 |
|
|
1083 |
codeforces#P1706D2 Chopping Carrots (Hard Version)
|
0 / 0 |
9 |
|
|
1078 |
codeforces#P1707D Partial Virtual Trees
|
0 / 0 |
10 |
|
|
1076 |
codeforces#P1707F Bugaboo
|
0 / 0 |
10 |
|
|
1072 |
codeforces#P1709B Also Try Minecraft
|
0 / 0 |
3 |
|
|
1068 |
codeforces#P1709F Multiset of Strings
|
0 / 0 |
9 |
|
|
1065 |
codeforces#P1710C XOR Triangle
|
0 / 0 |
9 |
|
|
1051 |
codeforces#P1713C Build Permutation
|
0 / 0 |
4 |
|
|
1048 |
codeforces#P1713F Lost Array
|
0 / 0 |
10 |
|
|
1044 |
codeforces#P1714D Color with Occurrences
|
0 / 0 |
5 |
|
|
1036 |
codeforces#P1715E Long Way Home
|
0 / 0 |
9 |
|
|
1032 |
codeforces#P1716C Robot in a Hallway
|
0 / 0 |
7 |
|
|
1031 |
codeforces#P1716D Chip Move
|
0 / 0 |
7 |
|
|
1030 |
codeforces#P1716E Swap and Maximum Block
|
0 / 0 |
9 |
|
|
1029 |
codeforces#P1716F Bags with Balls
|
0 / 0 |
9 |
|
|
1022 |
codeforces#P1718A1 Burenka and Traditions (easy version)
|
0 / 0 |
6 |
|
|
1021 |
codeforces#P1718A2 Burenka and Traditions (hard version)
|
0 / 0 |
6 |
|
|
1009 |
codeforces#P1720D1 Xor-Subsequence (easy version)
|
0 / 0 |
6 |
|
|
1008 |
codeforces#P1720D2 Xor-Subsequence (hard version)
|
0 / 0 |
9 |
|
|
1002 |
codeforces#P1721E Prefix Function Queries
|
0 / 0 |
8 |
|
|
996 |
codeforces#P1722E Counting Rectangles
|
0 / 0 |
5 |
|
|
989 |
codeforces#P1725E Electrical Efficiency
|
0 / 0 |
9 |
|
|
984 |
codeforces#P1725J Journey
|
0 / 0 |
9 |
|
|
981 |
codeforces#P1725M Moving Both Hands
|
0 / 0 |
6 |
|
|
969 |
codeforces#P1728D Letter Picking
|
0 / 0 |
6 |
|
|
966 |
codeforces#P1728G Illumination
|
0 / 0 |
10 |
|
|
959 |
codeforces#P1729G Cut Substrings
|
0 / 0 |
7 |
|
|
953 |
codeforces#P1730F Almost Sorted
|
0 / 0 |
10 |
|
|
949 |
codeforces#P1731D Valiant's New Map
|
0 / 0 |
5 |
|
|
948 |
codeforces#P1731E Graph Cost
|
0 / 0 |
7 |
|
|
947 |
codeforces#P1731F Function Sum
|
0 / 0 |
9 |
|
|
945 |
codeforces#P1732B Ugu
|
0 / 0 |
3 |
|
|
940 |
codeforces#P1732E Location
|
0 / 0 |
10 |
|
|
935 |
codeforces#P1733D2 Zero-One (Hard Version)
|
0 / 0 |
7 |
|
|
934 |
codeforces#P1733E Conveyor
|
0 / 0 |
10 |
|
|
930 |
codeforces#P1734D Slime Escape
|
0 / 0 |
6 |
|
|
928 |
codeforces#P1734F Zeros and Ones
|
0 / 0 |
9 |
|
|
918 |
codeforces#P1736C2 Good Subarrays (Hard Version)
|
0 / 0 |
9 |
|
|
916 |
codeforces#P1736E Swap and Take
|
0 / 0 |
10 |
|
|
912 |
codeforces#P1737D Ela and the Wiring Wizard
|
0 / 0 |
8 |
|
|
911 |
codeforces#P1737E Ela Goes Hiking
|
0 / 0 |
9 |
|
|
906 |
codeforces#P1738C Even Number Addicts
|
0 / 0 |
5 |
|
|
904 |
codeforces#P1738E Balance Addicts
|
0 / 0 |
8 |
|
|
902 |
codeforces#P1738G Anti-Increasing Addicts
|
0 / 0 |
10 |
|
|
898 |
codeforces#P1739C Card Game
|
0 / 0 |
5 |
|
|
896 |
codeforces#P1739E Cleaning Robot
|
0 / 0 |
9 |
|
|
895 |
codeforces#P1739F Keyboard Design
|
0 / 0 |
10 |
|
|
890 |
codeforces#P1740E Hanging Hearts
|
0 / 0 |
6 |
|
|
889 |
codeforces#P1740F Conditional Mix
|
0 / 0 |
10 |
|
|
886 |
codeforces#P1740I Arranging Crystal Balls
|
0 / 0 |
10 |
|
|
881 |
codeforces#P1741E Sending a Sequence Over the Network
|
0 / 0 |
5 |
|
|
879 |
codeforces#P1741G Kirill and Company
|
0 / 0 |
8 |
|
|
869 |
codeforces#P1743C Save the Magazines
|
0 / 0 |
3 |
|
|
868 |
codeforces#P1743D Problem with Random Tests
|
0 / 0 |
5 |
|
|
867 |
codeforces#P1743E FTL
|
0 / 0 |
9 |
|
|
866 |
codeforces#P1743F Intersection and Union
|
0 / 0 |
8 |
|
|
865 |
codeforces#P1743G Antifibonacci Cut
|
0 / 0 |
10 |
|
|
854 |
codeforces#P1746D Paths on the Tree
|
0 / 0 |
6 |
|
|
852 |
codeforces#P1746E2 Joking (Hard Version)
|
0 / 0 |
10 |
|
|
850 |
codeforces#P1746G Olympiad Training
|
0 / 0 |
10 |
|
|
845 |
codeforces#P1747E List Generation
|
0 / 0 |
10 |
|
|
842 |
codeforces#P1748C Zero-Sum Prefixes
|
0 / 0 |
5 |
|
|
840 |
codeforces#P1748E Yet Another Array Counting Problem
|
0 / 0 |
8 |
|
|
835 |
codeforces#P1749D Counting Arrays
|
0 / 0 |
6 |
|
|
828 |
codeforces#P1750E Bracket Cost
|
0 / 0 |
9 |
|
|
827 |
codeforces#P1750F Majority
|
0 / 0 |
10 |
|
|
826 |
codeforces#P1750G Doping
|
0 / 0 |
10 |
|
|
825 |
codeforces#P1750H BinaryStringForces
|
0 / 0 |
10 |
|
|
824 |
codeforces#P1753A1 Make Nonzero Sum (easy version)
|
0 / 0 |
4 |
