|
556 |
codeforces#P1797C Li Hua and Chess
|
0 / 0 |
5 |
|
555 |
codeforces#P1797D Li Hua and Tree
|
0 / 0 |
6 |
|
554 |
codeforces#P1797E Li Hua and Array
|
0 / 0 |
8 |
|
553 |
codeforces#P1797F Li Hua and Path
|
0 / 0 |
10 |
|
552 |
codeforces#P1798A Showstopper
|
0 / 0 |
3 |
|
551 |
codeforces#P1798B Three Sevens
|
0 / 0 |
3 |
|
550 |
codeforces#P1798C Candy Store
|
0 / 0 |
5 |
|
549 |
codeforces#P1798D Shocking Arrangement
|
0 / 0 |
5 |
|
548 |
codeforces#P1798E Multitest Generator
|
0 / 0 |
8 |
|
547 |
codeforces#P1798F Gifts from Grandfather Ahmed
|
0 / 0 |
9 |
|
546 |
codeforces#P1799A Recent Actions
|
0 / 0 |
3 |
|
545 |
codeforces#P1799B Equalize by Divide
|
0 / 0 |
4 |
|
544 |
codeforces#P1799C Double Lexicographically Minimum
|
0 / 0 |
5 |
|
543 |
codeforces#P1799D1 Hot Start Up (easy version)
|
0 / 0 |
6 |
|
542 |
codeforces#P1799D2 Hot Start Up (hard version)
|
0 / 0 |
7 |
|
541 |
codeforces#P1799E City Union
|
0 / 0 |
8 |
|
540 |
codeforces#P1799F Halve or Subtract
|
0 / 0 |
10 |
|
539 |
codeforces#P1799G Count Voting
|
0 / 0 |
10 |
|
538 |
codeforces#P1799H Tree Cutting
|
0 / 0 |
10 |
|
537 |
codeforces#P1800A Is It a Cat?
|
0 / 0 |
3 |
|
536 |
codeforces#P1800B Count the Number of Pairs
|
0 / 0 |
3 |
|
535 |
codeforces#P1800C1 Powering the Hero (easy version)
|
0 / 0 |
3 |
|
534 |
codeforces#P1800C2 Powering the Hero (hard version)
|
0 / 0 |
3 |
|
533 |
codeforces#P1800D Remove Two Letters
|
0 / 0 |
4 |
|
532 |
codeforces#P1800E1 Unforgivable Curse (easy version)
|
0 / 0 |
4 |
|
531 |
codeforces#P1800E2 Unforgivable Curse (hard version)
|
0 / 0 |
5 |
|
530 |
codeforces#P1800F Dasha and Nightmares
|
0 / 0 |
6 |
|
529 |
codeforces#P1800G Symmetree
|
0 / 0 |
8 |
|
528 |
codeforces#P1801A The Very Beautiful Blanket
|
0 / 0 |
5 |
|
527 |
codeforces#P1801B Buying gifts
|
0 / 0 |
6 |
|
526 |
codeforces#P1801C Music Festival
|
0 / 0 |
6 |
|
525 |
codeforces#P1801D The way home
|
0 / 0 |
7 |
|
524 |
codeforces#P1801E Gasoline prices
|
0 / 0 |
10 |
|
523 |
codeforces#P1801F Another n-dimensional chocolate bar
|
0 / 0 |
10 |
|
522 |
codeforces#P1801G A task for substrings
|
0 / 0 |
10 |
|
521 |
codeforces#P1802A Likes
|
0 / 0 |
3 |
|
520 |
codeforces#P1802B Settlement of Guinea Pigs
|
0 / 0 |
3 |
|
519 |
codeforces#P1804A Lame King
|
0 / 0 |
3 |
|
518 |
codeforces#P1804B Vaccination
|
0 / 0 |
3 |
|
517 |
codeforces#P1804C Pull Your Luck
|
0 / 0 |
5 |
|
516 |
codeforces#P1804D Accommodation
|
0 / 0 |
7 |
|
515 |
codeforces#P1804E Routing
|
0 / 0 |
9 |
|
514 |
codeforces#P1804F Approximate Diameter
|
0 / 0 |
10 |
|
513 |
codeforces#P1804G Flow Control
|
0 / 0 |
10 |
|
512 |
codeforces#P1804H Code Lock
|
0 / 0 |
10 |
|
511 |
codeforces#P1805A We Need the Zero
|
0 / 0 |
3 |
|
510 |
codeforces#P1805B The String Has a Target
|
0 / 0 |
3 |
|
509 |
codeforces#P1805C Place for a Selfie
|
0 / 0 |
4 |
|
508 |
codeforces#P1805D A Wide, Wide Graph
|
0 / 0 |
6 |
|
507 |
codeforces#P1805E There Should Be a Lot of Maximums
|
0 / 0 |
8 |
|
506 |
codeforces#P1805F1 Survival of the Weakest (easy version)
|
0 / 0 |
10 |
|
505 |
codeforces#P1805F2 Survival of the Weakest (hard version)
|
0 / 0 |
10 |
|
504 |
codeforces#P1806A Walking Master
|
0 / 0 |
3 |
|
503 |
codeforces#P1806B Mex Master
|
0 / 0 |
3 |
|
502 |
codeforces#P1806C Sequence Master
|
0 / 0 |
5 |
|
501 |
codeforces#P1806D DSU Master
|
0 / 0 |
9 |
|
500 |
codeforces#P1806E Tree Master
|
0 / 0 |
8 |
|
499 |
codeforces#P1806F1 GCD Master (easy version)
|
0 / 0 |
10 |
|
498 |
codeforces#P1806F2 GCD Master (hard version)
|
0 / 0 |
10 |
|
497 |
codeforces#P1807A Plus or Minus
|
0 / 0 |
3 |
|
496 |
codeforces#P1807B Grab the Candies
|
0 / 0 |
3 |
|
495 |
codeforces#P1807C Find and Replace
|
0 / 0 |
3 |
|
494 |
codeforces#P1807D Odd Queries
|
0 / 0 |
3 |
|
493 |
codeforces#P1807E Interview
|
0 / 0 |
4 |
|
492 |
codeforces#P1807F Bouncy Ball
|
0 / 0 |
5 |
|
491 |
codeforces#P1807G1 Subsequence Addition (Easy Version)
|
0 / 0 |
3 |
|
490 |
codeforces#P1807G2 Subsequence Addition (Hard Version)
|
0 / 0 |
3 |
|
489 |
codeforces#P1808A Lucky Numbers
|
0 / 0 |
3 |
|
488 |
codeforces#P1808B Playing in a Casino
|
0 / 0 |
4 |
|
487 |
codeforces#P1808C Unlucky Numbers
|
0 / 0 |
6 |
|
486 |
codeforces#P1808D Petya, Petya, Petr, and Palindromes
|
0 / 0 |
7 |
|
485 |
codeforces#P1808E1 Minibuses on Venus (easy version)
|
0 / 0 |
8 |
|
484 |
codeforces#P1808E2 Minibuses on Venus (medium version)
|
0 / 0 |
9 |
|
483 |
codeforces#P1808E3 Minibuses on Venus (hard version)
|
0 / 0 |
10 |
|
482 |
codeforces#P1809A Garland
|
0 / 0 |
3 |
|
481 |
codeforces#P1809B Points on Plane
|
0 / 0 |
3 |
|
480 |
codeforces#P1809C Sum on Subarrays
|
0 / 0 |
5 |
|
479 |
codeforces#P1809D Binary String Sorting
|
0 / 0 |
6 |
|
478 |
codeforces#P1809E Two Tanks
|
0 / 0 |
9 |
|
477 |
codeforces#P1809F Traveling in Berland
|
0 / 0 |
9 |
|
476 |
codeforces#P1809G Prediction
|
0 / 0 |
10 |
|
475 |
codeforces#P1810A Beautiful Sequence
|
0 / 0 |
3 |
|
474 |
codeforces#P1810B Candies
|
0 / 0 |
3 |
|
473 |
codeforces#P1810C Make It Permutation
|
0 / 0 |
4 |
|
472 |
codeforces#P1810D Climbing the Tree
|
0 / 0 |
5 |
|
471 |
codeforces#P1810E Monsters
|
0 / 0 |
7 |
|
470 |
codeforces#P1810F M-tree
|
0 / 0 |
10 |
|
469 |
codeforces#P1810G The Maximum Prefix
|
0 / 0 |
10 |
|
468 |
codeforces#P1810H Last Number
|
0 / 0 |
10 |
|
467 |
codeforces#P1811A Insert Digit
|
0 / 0 |
3 |
|
466 |
codeforces#P1811B Conveyor Belts
|
0 / 0 |
3 |
|
465 |
codeforces#P1811C Restore the Array
|
0 / 0 |
3 |
|
464 |
codeforces#P1811D Umka and a Long Flight
|
0 / 0 |
5 |
|
463 |
codeforces#P1811E Living Sequence
|
0 / 0 |
5 |
|
462 |
codeforces#P1811F Is It Flower?
|
0 / 0 |
7 |
|
461 |
codeforces#P1811G1 Vlad and the Nice Paths (easy version)
|
0 / 0 |
7 |
|
460 |
codeforces#P1811G2 Vlad and the Nice Paths (hard version)
|
0 / 0 |
8 |
|
459 |
codeforces#P1812A Are You a Robot?
|
0 / 0 |
(None) |
|
458 |
codeforces#P1812B Was it Rated?
|
0 / 0 |
(None) |
|
457 |
codeforces#P1812C Digits
|
0 / 0 |
(None) |