|
344 |
P1741B
Funny Permutation
|
0 / 0 |
3 |
|
343 |
P1741C
Minimize the Thickness
|
0 / 0 |
3 |
|
342 |
P1741D
Masha and a Beautiful Tree
|
0 / 0 |
4 |
|
341 |
P1741E
Sending a Sequence Over the Network
|
0 / 0 |
5 |
|
340 |
P1741F
Multi-Colored Segments
|
0 / 0 |
7 |
|
339 |
P1741G
Kirill and Company
|
0 / 0 |
8 |
|
338 |
P1742A
Sum
|
0 / 0 |
3 |
|
337 |
P1742B
Increasing
|
0 / 0 |
3 |
|
336 |
P1742C
Stripes
|
0 / 0 |
3 |
|
335 |
P1742D
Coprime
|
0 / 0 |
3 |
|
334 |
P1742E
Scuza
|
0 / 0 |
4 |
|
333 |
P1742F
Smaller
|
0 / 0 |
5 |
|
332 |
P1742G
Orray
|
0 / 0 |
5 |
|
331 |
P1743A
Password
|
0 / 0 |
3 |
|
330 |
P1743B
Permutation Value
|
0 / 0 |
3 |
|
329 |
P1743C
Save the Magazines
|
0 / 0 |
3 |
|
328 |
P1743D
Problem with Random Tests
|
0 / 0 |
5 |
|
327 |
P1743E
FTL
|
0 / 0 |
9 |
|
326 |
P1743F
Intersection and Union
|
0 / 0 |
8 |
|
325 |
P1743G
Antifibonacci Cut
|
0 / 0 |
10 |
|
324 |
P1744A
Number Replacement
|
0 / 0 |
3 |
|
323 |
P1744B
Even-Odd Increments
|
0 / 0 |
3 |
|
322 |
P1744C
Traffic Light
|
0 / 0 |
3 |
|
321 |
P1744D
Divisibility by 2^n
|
0 / 0 |
4 |
|
320 |
P1744E1
Divisible Numbers (easy version)
|
0 / 0 |
5 |
|
319 |
P1744E2
Divisible Numbers (hard version)
|
0 / 0 |
6 |
|
318 |
P1744F
MEX vs MED
|
0 / 0 |
7 |
|
317 |
P1746A
Maxmina
|
0 / 0 |
3 |
|
316 |
P1746B
Rebellion
|
0 / 0 |
3 |
|
315 |
P1746C
Permutation Operations
|
0 / 0 |
4 |
|
314 |
P1746D
Paths on the Tree
|
0 / 0 |
6 |
|
313 |
P1746E1
Joking (Easy Version)
|
0 / 0 |
9 |
|
312 |
P1746E2
Joking (Hard Version)
|
0 / 0 |
10 |
|
311 |
P1746F
Kazaee
|
0 / 0 |
10 |
|
310 |
P1746G
Olympiad Training
|
0 / 0 |
10 |
|
309 |
P1747A
Two Groups
|
0 / 0 |
3 |
|
308 |
P1747B
BAN BAN
|
0 / 0 |
3 |
|
307 |
P1747C
Swap Game
|
0 / 0 |
4 |
|
306 |
P1747D
Yet Another Problem
|
0 / 0 |
6 |
|
305 |
P1747E
List Generation
|
0 / 0 |
10 |
|
304 |
P1748A
The Ultimate Square
|
0 / 0 |
3 |
|
303 |
P1748B
Diverse Substrings
|
0 / 0 |
4 |
|
302 |
P1748C
Zero-Sum Prefixes
|
0 / 0 |
5 |
|
301 |
P1748D
ConstructOR
|
0 / 0 |
7 |
|
300 |
P1748E
Yet Another Array Counting Problem
|
0 / 0 |
8 |
|
299 |
P1748F
Circular Xor Reversal
|
0 / 0 |
10 |
|
298 |
P1749A
Cowardly Rooks
|
0 / 0 |
3 |
|
297 |
P1749B
Death's Blessing
|
0 / 0 |
3 |
|
296 |
P1749C
Number Game
|
0 / 0 |
4 |
|
295 |
P1749D
Counting Arrays
|
0 / 0 |
6 |
|
294 |
P1749E
Cactus Wall
|
0 / 0 |
9 |
|
293 |
P1749F
Distance to the Path
|
0 / 0 |
10 |
|
292 |
P1750A
Indirect Sort
|
0 / 0 |
3 |
|
291 |
P1750B
Maximum Substring
|
0 / 0 |
3 |
|
290 |
P1750C
Complementary XOR
|
0 / 0 |
4 |
|
289 |
P1750D
Count GCD
|
0 / 0 |
6 |
|
288 |
P1750E
Bracket Cost
|
0 / 0 |
9 |
|
287 |
P1750F
Majority
|
0 / 0 |
10 |
|
286 |
P1750G
Doping
|
0 / 0 |
10 |
|
285 |
P1750H
BinaryStringForces
|
0 / 0 |
10 |
|
284 |
P1753A1
Make Nonzero Sum (easy version)
|
0 / 0 |
4 |
|
283 |
P1753A2
Make Nonzero Sum (hard version)
|
0 / 0 |
5 |
|
282 |
P1753B
Factorial Divisibility
|
0 / 0 |
5 |
|
281 |
P1753C
Wish I Knew How to Sort
|
0 / 0 |
7 |
|
280 |
P1753D
The Beach
|
0 / 0 |
9 |
|
279 |
P1753E
N Machines
|
0 / 0 |
10 |
|
278 |
P1753F
Minecraft Series
|
0 / 0 |
10 |
|
277 |
P1754A
Technical Support
|
0 / 0 |
3 |
|
276 |
P1754B
Kevin and Permutation
|
0 / 0 |
3 |
|
275 |
P1758A
SSeeeeiinngg DDoouubbllee
|
0 / 0 |
3 |
|
274 |
P1758B
XOR = Average
|
0 / 0 |
3 |
|
273 |
P1758C
Almost All Multiples
|
0 / 0 |
4 |
|
272 |
P1758D
Range = √Sum
|
0 / 0 |
6 |
|
271 |
P1758E
Tick, Tock
|
0 / 0 |
9 |
|
270 |
P1758F
Decent Division
|
0 / 0 |
10 |
|
269 |
P1759A
Yes-Yes?
|
0 / 0 |
3 |
|
268 |
P1759B
Lost Permutation
|
0 / 0 |
3 |
|
267 |
P1759C
Thermostat
|
0 / 0 |
3 |
|
266 |
P1759D
Make It Round
|
0 / 0 |
4 |
|
265 |
P1759E
The Humanoid
|
0 / 0 |
5 |
|
264 |
P1759F
All Possible Digits
|
0 / 0 |
6 |
|
263 |
P1759G
Restore the Permutation
|
0 / 0 |
6 |
|
262 |
P1760A
Medium Number
|
0 / 0 |
3 |
|
261 |
P1760B
Atilla's Favorite Problem
|
0 / 0 |
3 |
|
260 |
P1760C
Advantage
|
0 / 0 |
3 |
|
259 |
P1760D
Challenging Valleys
|
0 / 0 |
3 |
|
258 |
P1760E
Binary Inversions
|
0 / 0 |
3 |
|
257 |
P1760F
Quests
|
0 / 0 |
5 |
|
256 |
P1760G
SlavicG's Favorite Problem
|
0 / 0 |
5 |
|
255 |
P1761A
Two Permutations
|
0 / 0 |
3 |
|
254 |
P1761B
Elimination of a Ring
|
0 / 0 |
3 |
|
253 |
P1761C
Set Construction
|
0 / 0 |
4 |
|
252 |
P1761D
Carry Bit
|
0 / 0 |
7 |
|
251 |
P1761E
Make It Connected
|
0 / 0 |
9 |
|
250 |
P1761F1
Anti-median (Easy Version)
|
0 / 0 |
10 |
|
249 |
P1761F2
Anti-median (Hard Version)
|
0 / 0 |
10 |
|
248 |
P1761G
Centroid Guess
|
0 / 0 |
10 |
|
247 |
P1762A
Divide and Conquer
|
0 / 0 |
3 |
|
246 |
P1762B
Make Array Good
|
0 / 0 |
3 |
|
245 |
P1762C
Binary Strings are Fun
|
0 / 0 |
4 |