|
|
463 |
P1672H
Zigu Zagu
|
0 / 0 |
10 |
|
|
462 |
P1672I
PermutationForces
|
0 / 0 |
10 |
|
|
461 |
P1673A
Subtle Substring Subtraction
|
0 / 0 |
3 |
|
|
460 |
P1673B
A Perfectly Balanced String?
|
0 / 0 |
3 |
|
|
459 |
P1673C
Palindrome Basis
|
0 / 0 |
5 |
|
|
458 |
P1673D
Lost Arithmetic Progression
|
0 / 0 |
6 |
|
|
457 |
P1673E
Power or XOR?
|
0 / 0 |
9 |
|
|
456 |
P1673F
Anti-Theft Road Planning
|
0 / 0 |
9 |
|
|
455 |
P1674A
Number Transformation
|
0 / 0 |
3 |
|
|
454 |
P1674B
Dictionary
|
0 / 0 |
3 |
|
|
453 |
P1674C
Infinite Replacement
|
0 / 0 |
3 |
|
|
452 |
P1674D
A-B-C Sort
|
0 / 0 |
4 |
|
|
451 |
P1674E
Breaking the Wall
|
0 / 0 |
7 |
|
|
450 |
P1674F
Desktop Rearrangement
|
0 / 0 |
6 |
|
|
449 |
P1674G
Remove Directed Edges
|
0 / 0 |
7 |
|
|
448 |
P1675A
Food for Animals
|
0 / 0 |
3 |
|
|
447 |
P1675B
Make It Increasing
|
0 / 0 |
3 |
|
|
446 |
P1675C
Detective Task
|
0 / 0 |
3 |
|
|
445 |
P1675D
Vertical Paths
|
0 / 0 |
4 |
|
|
444 |
P1675E
Replace With the Previous, Minimize
|
0 / 0 |
5 |
|
|
443 |
P1675F
Vlad and Unfinished Business
|
0 / 0 |
6 |
|
|
442 |
P1675G
Sorting Pancakes
|
0 / 0 |
8 |
|
|
441 |
P1676A
Lucky?
|
0 / 0 |
3 |
|
|
440 |
P1676B
Equal Candies
|
0 / 0 |
3 |
|
|
439 |
P1676C
Most Similar Words
|
0 / 0 |
3 |
|
|
438 |
P1676D
X-Sum
|
0 / 0 |
3 |
|
|
437 |
P1676E
Eating Queries
|
0 / 0 |
3 |
|
|
436 |
P1676F
Longest Strike
|
0 / 0 |
4 |
|
|
435 |
P1676G
White-Black Balanced Subtrees
|
0 / 0 |
4 |
|
|
434 |
P1676H1
Maximum Crossings (Easy Version)
|
0 / 0 |
4 |
|
|
433 |
P1676H2
Maximum Crossings (Hard Version)
|
0 / 0 |
5 |
|
|
432 |
P1677A
Tokitsukaze and Strange Inequality
|
0 / 0 |
5 |
|
|
431 |
P1677B
Tokitsukaze and Meeting
|
0 / 0 |
5 |
|
|
430 |
P1677C
Tokitsukaze and Two Colorful Tapes
|
0 / 0 |
6 |
|
|
429 |
P1677D
Tokitsukaze and Permutations
|
0 / 0 |
9 |
|
|
428 |
P1677E
Tokitsukaze and Beautiful Subsegments
|
0 / 0 |
10 |
|
|
427 |
P1677F
Tokitsukaze and Gems
|
0 / 0 |
10 |
|
|
426 |
P1678A
Tokitsukaze and All Zero Sequence
|
0 / 0 |
3 |
|
|
425 |
P1678B1
Tokitsukaze and Good 01-String (easy version)
|
0 / 0 |
3 |
|
|
424 |
P1678B2
Tokitsukaze and Good 01-String (hard version)
|
0 / 0 |
6 |
|
|
423 |
P1679A
AvtoBus
|
0 / 0 |
3 |
|
|
422 |
P1679B
Stone Age Problem
|
0 / 0 |
4 |
|
|
421 |
P1679C
Rooks Defenders
|
0 / 0 |
4 |
|
|
420 |
P1679D
Toss a Coin to Your Graph...
|
0 / 0 |
6 |
|
|
419 |
P1679E
Typical Party in Dorm
|
0 / 0 |
9 |
|
|
418 |
P1679F
Formalism for Formalism
|
0 / 0 |
10 |
|
|
417 |
P1680A
Minimums and Maximums
|
0 / 0 |
3 |
|
|
416 |
P1680B
Robots
|
0 / 0 |
3 |
|
|
415 |
P1680C
Binary String
|
0 / 0 |
5 |
|
|
414 |
P1680D
Dog Walking
|
0 / 0 |
9 |
|
|
413 |
P1680E
Moving Chips
|
0 / 0 |
7 |
|
|
412 |
P1680F
Lenient Vertex Cover
|
0 / 0 |
10 |
|
|
411 |
P1681A
Game with Cards
|
0 / 0 |
3 |
|
|
410 |
P1681B
Card Trick
|
0 / 0 |
3 |
|
|
409 |
P1681C
Double Sort
|
0 / 0 |
4 |
|
|
408 |
P1681D
Required Length
|
0 / 0 |
5 |
|
|
407 |
P1681E
Labyrinth Adventures
|
0 / 0 |
10 |
|
|
406 |
P1681F
Unique Occurrences
|
0 / 0 |
8 |
|
|
405 |
P1682A
Palindromic Indices
|
0 / 0 |
3 |
|
|
404 |
P1682B
AND Sorting
|
0 / 0 |
3 |
|
|
403 |
P1682C
LIS or Reverse LIS?
|
0 / 0 |
4 |
|
|
402 |
P1682D
Circular Spanning Tree
|
0 / 0 |
7 |
|
|
401 |
P1682E
Unordered Swaps
|
0 / 0 |
10 |
|
|
400 |
P1682F
MCMF?
|
0 / 0 |
10 |
|
|
399 |
P1684A
Digit Minimization
|
0 / 0 |
3 |
|
|
398 |
P1684B
Z mod X = C
|
0 / 0 |
3 |
|
|
397 |
P1684C
Column Swapping
|
0 / 0 |
4 |
|
|
396 |
P1684D
Traps
|
0 / 0 |
5 |
|
|
395 |
P1684E
MEX vs DIFF
|
0 / 0 |
7 |
|
|
394 |
P1684F
Diverse Segments
|
0 / 0 |
10 |
|
|
393 |
P1684G
Euclid Guess
|
0 / 0 |
10 |
|
|
392 |
P1684H
Hard Cut
|
0 / 0 |
10 |
|
|
391 |
P1685A
Circular Local MiniMax
|
0 / 0 |
3 |
|
|
390 |
P1685B
Linguistics
|
0 / 0 |
7 |
|
|
389 |
P1685C
Bring Balance
|
0 / 0 |
10 |
|
|
388 |
P1685D1
Permutation Weight (Easy Version)
|
0 / 0 |
10 |
|
|
387 |
P1685D2
Permutation Weight (Hard Version)
|
0 / 0 |
10 |
|
|
386 |
P1685E
The Ultimate LIS Problem
|
0 / 0 |
10 |
|
|
385 |
P1686A
Everything Everywhere All But One
|
0 / 0 |
3 |
|
|
384 |
P1686B
Odd Subarrays
|
0 / 0 |
3 |
|
|
383 |
P1687A
The Enchanted Forest
|
0 / 0 |
5 |
|
|
382 |
P1687B
Railway System
|
0 / 0 |
5 |
|
|
381 |
P1687C
Sanae and Giant Robot
|
0 / 0 |
9 |
|
|
380 |
P1687D
Cute number
|
0 / 0 |
10 |
|
|
379 |
P1687E
Become Big For Me
|
0 / 0 |
10 |
|
|
378 |
P1687F
Koishi's Unconscious Permutation
|
0 / 0 |
10 |
|
|
377 |
P1688A
Cirno's Perfect Bitmasks Classroom
|
0 / 0 |
3 |
|
|
376 |
P1688B
Patchouli's Magical Talisman
|
0 / 0 |
3 |
|
|
375 |
P1688C
Manipulating History
|
0 / 0 |
5 |
|
|
374 |
P1689A
Lex String
|
0 / 0 |
3 |
|
|
373 |
P1689B
Mystic Permutation
|
0 / 0 |
3 |
|
|
372 |
P1689C
Infected Tree
|
0 / 0 |
5 |
|
|
371 |
P1689D
Lena and Matrix
|
0 / 0 |
6 |
|
|
370 |
P1689E
ANDfinity
|
0 / 0 |
9 |
|
|
369 |
P1690A
Print a Pedestal (Codeforces logo?)
|
0 / 0 |
3 |
|
|
368 |
P1690B
Array Decrements
|
0 / 0 |
3 |
|
|
367 |
P1690C
Restoring the Duration of Tasks
|
0 / 0 |
3 |
|
|
366 |
P1690D
Black and White Stripe
|
0 / 0 |
3 |
|
|
365 |
P1690E
Price Maximization
|
0 / 0 |
5 |
|
|
364 |
P1690F
Shifting String
|
0 / 0 |
5 |
