|
|
1237 |
P1672H
Zigu Zagu
|
0 / 0 |
10 |
|
|
1236 |
P1672I
PermutationForces
|
0 / 0 |
10 |
|
|
1235 |
P1673A
Subtle Substring Subtraction
|
0 / 0 |
3 |
|
|
1234 |
P1673B
A Perfectly Balanced String?
|
0 / 0 |
3 |
|
|
1233 |
P1673C
Palindrome Basis
|
0 / 0 |
5 |
|
|
1232 |
P1673D
Lost Arithmetic Progression
|
0 / 0 |
6 |
|
|
1231 |
P1673E
Power or XOR?
|
0 / 0 |
9 |
|
|
1230 |
P1673F
Anti-Theft Road Planning
|
0 / 0 |
9 |
|
|
1229 |
P1674A
Number Transformation
|
0 / 0 |
3 |
|
|
1228 |
P1674B
Dictionary
|
0 / 0 |
3 |
|
|
1227 |
P1674C
Infinite Replacement
|
0 / 0 |
3 |
|
|
1226 |
P1674D
A-B-C Sort
|
0 / 0 |
4 |
|
|
1225 |
P1674E
Breaking the Wall
|
0 / 0 |
7 |
|
|
1224 |
P1674F
Desktop Rearrangement
|
0 / 0 |
6 |
|
|
1223 |
P1674G
Remove Directed Edges
|
0 / 0 |
7 |
|
|
1222 |
P1675A
Food for Animals
|
0 / 0 |
3 |
|
|
1221 |
P1675B
Make It Increasing
|
0 / 0 |
3 |
|
|
1220 |
P1675C
Detective Task
|
0 / 0 |
3 |
|
|
1219 |
P1675D
Vertical Paths
|
0 / 0 |
4 |
|
|
1218 |
P1675E
Replace With the Previous, Minimize
|
0 / 0 |
5 |
|
|
1217 |
P1675F
Vlad and Unfinished Business
|
0 / 0 |
6 |
|
|
1216 |
P1675G
Sorting Pancakes
|
0 / 0 |
8 |
|
|
1215 |
P1676A
Lucky?
|
0 / 0 |
3 |
|
|
1214 |
P1676B
Equal Candies
|
0 / 0 |
3 |
|
|
1213 |
P1676C
Most Similar Words
|
0 / 0 |
3 |
|
|
1212 |
P1676D
X-Sum
|
0 / 0 |
3 |
|
|
1211 |
P1676E
Eating Queries
|
0 / 0 |
3 |
|
|
1210 |
P1676F
Longest Strike
|
0 / 0 |
4 |
|
|
1209 |
P1676G
White-Black Balanced Subtrees
|
0 / 0 |
4 |
|
|
1208 |
P1676H1
Maximum Crossings (Easy Version)
|
0 / 0 |
4 |
|
|
1207 |
P1676H2
Maximum Crossings (Hard Version)
|
0 / 0 |
5 |
|
|
1206 |
P1677A
Tokitsukaze and Strange Inequality
|
0 / 0 |
5 |
|
|
1205 |
P1677B
Tokitsukaze and Meeting
|
0 / 0 |
5 |
|
|
1204 |
P1677C
Tokitsukaze and Two Colorful Tapes
|
0 / 0 |
6 |
|
|
1203 |
P1677D
Tokitsukaze and Permutations
|
0 / 0 |
9 |
|
|
1202 |
P1677E
Tokitsukaze and Beautiful Subsegments
|
0 / 0 |
10 |
|
|
1201 |
P1677F
Tokitsukaze and Gems
|
0 / 0 |
10 |
|
|
1200 |
P1678A
Tokitsukaze and All Zero Sequence
|
0 / 0 |
3 |
|
|
1199 |
P1678B1
Tokitsukaze and Good 01-String (easy version)
|
0 / 0 |
3 |
|
|
1198 |
P1678B2
Tokitsukaze and Good 01-String (hard version)
|
0 / 0 |
6 |
|
|
1197 |
P1679A
AvtoBus
|
0 / 0 |
3 |
|
|
1196 |
P1679B
Stone Age Problem
|
0 / 0 |
4 |
|
|
1195 |
P1679C
Rooks Defenders
|
0 / 0 |
4 |
|
|
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 |
|
|
1191 |
P1680A
Minimums and Maximums
|
0 / 0 |
3 |
|
|
1190 |
P1680B
Robots
|
0 / 0 |
3 |
|
|
1189 |
P1680C
Binary String
|
0 / 0 |
5 |
|
|
1188 |
P1680D
Dog Walking
|
0 / 0 |
9 |
|
|
1187 |
P1680E
Moving Chips
|
0 / 0 |
7 |
|
|
1186 |
P1680F
Lenient Vertex Cover
|
0 / 0 |
10 |
|
|
1185 |
P1681A
Game with Cards
|
0 / 0 |
3 |
|
|
1184 |
P1681B
Card Trick
|
0 / 0 |
3 |
|
|
1183 |
P1681C
Double Sort
|
0 / 0 |
4 |
|
|
1182 |
P1681D
Required Length
|
0 / 0 |
5 |
|
|
1181 |
P1681E
Labyrinth Adventures
|
0 / 0 |
10 |
|
|
1180 |
P1681F
Unique Occurrences
|
0 / 0 |
8 |
|
|
1179 |
P1682A
Palindromic Indices
|
0 / 0 |
3 |
|
|
1178 |
P1682B
AND Sorting
|
0 / 0 |
3 |
|
|
1177 |
P1682C
LIS or Reverse LIS?
|
0 / 0 |
4 |
|
|
1176 |
P1682D
Circular Spanning Tree
|
0 / 0 |
7 |
|
|
1175 |
P1682E
Unordered Swaps
|
0 / 0 |
10 |
|
|
1174 |
P1682F
MCMF?
|
0 / 0 |
10 |
|
|
1173 |
P1684A
Digit Minimization
|
0 / 0 |
3 |
|
|
1172 |
P1684B
Z mod X = C
|
0 / 0 |
3 |
|
|
1171 |
P1684C
Column Swapping
|
0 / 0 |
4 |
|
|
1170 |
P1684D
Traps
|
0 / 0 |
5 |
|
|
1169 |
P1684E
MEX vs DIFF
|
0 / 0 |
7 |
|
|
1168 |
P1684F
Diverse Segments
|
0 / 0 |
10 |
|
|
1167 |
P1684G
Euclid Guess
|
0 / 0 |
10 |
|
|
1166 |
P1684H
Hard Cut
|
0 / 0 |
10 |
|
|
1165 |
P1685A
Circular Local MiniMax
|
0 / 0 |
3 |
|
|
1164 |
P1685B
Linguistics
|
0 / 0 |
7 |
|
|
1163 |
P1685C
Bring Balance
|
0 / 0 |
10 |
|
|
1162 |
P1685D1
Permutation Weight (Easy Version)
|
0 / 0 |
10 |
|
|
1161 |
P1685D2
Permutation Weight (Hard Version)
|
0 / 0 |
10 |
|
|
1160 |
P1685E
The Ultimate LIS Problem
|
0 / 0 |
10 |
|
|
1159 |
P1686A
Everything Everywhere All But One
|
0 / 0 |
3 |
|
|
1158 |
P1686B
Odd Subarrays
|
0 / 0 |
3 |
|
|
1157 |
P1687A
The Enchanted Forest
|
0 / 0 |
5 |
|
|
1156 |
P1687B
Railway System
|
0 / 0 |
5 |
|
|
1155 |
P1687C
Sanae and Giant Robot
|
0 / 0 |
9 |
|
|
1154 |
P1687D
Cute number
|
0 / 0 |
10 |
|
|
1153 |
P1687E
Become Big For Me
|
0 / 0 |
10 |
|
|
1152 |
P1687F
Koishi's Unconscious Permutation
|
0 / 0 |
10 |
|
|
1151 |
P1688A
Cirno's Perfect Bitmasks Classroom
|
0 / 0 |
3 |
|
|
1150 |
P1688B
Patchouli's Magical Talisman
|
0 / 0 |
3 |
|
|
1149 |
P1688C
Manipulating History
|
0 / 0 |
5 |
|
|
1148 |
P1689A
Lex String
|
0 / 0 |
3 |
|
|
1147 |
P1689B
Mystic Permutation
|
0 / 0 |
3 |
|
|
1146 |
P1689C
Infected Tree
|
0 / 0 |
5 |
|
|
1145 |
P1689D
Lena and Matrix
|
0 / 0 |
6 |
|
|
1144 |
P1689E
ANDfinity
|
0 / 0 |
9 |
|
|
1143 |
P1690A
Print a Pedestal (Codeforces logo?)
|
0 / 0 |
3 |
|
|
1142 |
P1690B
Array Decrements
|
0 / 0 |
3 |
|
|
1141 |
P1690C
Restoring the Duration of Tasks
|
0 / 0 |
3 |
|
|
1140 |
P1690D
Black and White Stripe
|
0 / 0 |
3 |
|
|
1139 |
P1690E
Price Maximization
|
0 / 0 |
5 |
|
|
1138 |
P1690F
Shifting String
|
0 / 0 |
5 |
