|
|
537 |
P1792F1
Graph Coloring (easy version)
|
0 / 0 |
10 |
|
|
536 |
P1792F2
Graph Coloring (hard version)
|
0 / 0 |
10 |
|
|
535 |
P1793A
Yet Another Promotion
|
0 / 0 |
3 |
|
|
534 |
P1793B
Fedya and Array
|
0 / 0 |
3 |
|
|
533 |
P1793C
Dora and Search
|
0 / 0 |
4 |
|
|
532 |
P1793D
Moscow Gorillas
|
0 / 0 |
6 |
|
|
531 |
P1793E
Velepin and Marketing
|
0 / 0 |
10 |
|
|
530 |
P1793F
Rebrending
|
0 / 0 |
10 |
|
|
529 |
P1794A
Prefix and Suffix Array
|
0 / 0 |
3 |
|
|
528 |
P1794B
Not Dividing
|
0 / 0 |
3 |
|
|
527 |
P1794C
Scoring Subsequences
|
0 / 0 |
4 |
|
|
526 |
P1794D
Counting Factorizations
|
0 / 0 |
6 |
|
|
525 |
P1794E
Labeling the Tree with Distances
|
0 / 0 |
9 |
|
|
524 |
P1795A
Two Towers
|
0 / 0 |
3 |
|
|
523 |
P1795B
Ideal Point
|
0 / 0 |
3 |
|
|
522 |
P1795C
Tea Tasting
|
0 / 0 |
5 |
|
|
521 |
P1795D
Triangle Coloring
|
0 / 0 |
5 |
|
|
520 |
P1795E
Explosions?
|
0 / 0 |
8 |
|
|
519 |
P1795F
Blocking Chips
|
0 / 0 |
9 |
|
|
518 |
P1795G
Removal Sequences
|
0 / 0 |
10 |
|
|
517 |
P1796A
Typical Interview Problem
|
0 / 0 |
3 |
|
|
516 |
P1796B
Asterisk-Minor Template
|
0 / 0 |
3 |
|
|
515 |
P1796C
Maximum Set
|
0 / 0 |
5 |
|
|
514 |
P1796D
Maximum Subarray
|
0 / 0 |
7 |
|
|
513 |
P1796E
Colored Subgraphs
|
0 / 0 |
9 |
|
|
512 |
P1796F
Strange Triples
|
0 / 0 |
10 |
|
|
511 |
P1797A
Li Hua and Maze
|
0 / 0 |
3 |
|
|
510 |
P1797B
Li Hua and Pattern
|
0 / 0 |
3 |
|
|
509 |
P1797C
Li Hua and Chess
|
0 / 0 |
5 |
|
|
508 |
P1797D
Li Hua and Tree
|
0 / 0 |
6 |
|
|
507 |
P1797E
Li Hua and Array
|
0 / 0 |
8 |
|
|
506 |
P1797F
Li Hua and Path
|
0 / 0 |
10 |
|
|
505 |
P1798A
Showstopper
|
0 / 0 |
3 |
|
|
504 |
P1798B
Three Sevens
|
0 / 0 |
3 |
|
|
503 |
P1798C
Candy Store
|
0 / 0 |
5 |
|
|
502 |
P1798D
Shocking Arrangement
|
0 / 0 |
5 |
|
|
501 |
P1798E
Multitest Generator
|
0 / 0 |
8 |
|
|
500 |
P1798F
Gifts from Grandfather Ahmed
|
0 / 0 |
9 |
|
|
499 |
P1799A
Recent Actions
|
0 / 0 |
3 |
|
|
498 |
P1799B
Equalize by Divide
|
0 / 0 |
4 |
|
|
497 |
P1799C
Double Lexicographically Minimum
|
0 / 0 |
5 |
|
|
496 |
P1799D1
Hot Start Up (easy version)
|
0 / 0 |
6 |
|
|
495 |
P1799D2
Hot Start Up (hard version)
|
0 / 0 |
7 |
|
|
494 |
P1799E
City Union
|
0 / 0 |
8 |
|
|
493 |
P1799F
Halve or Subtract
|
0 / 0 |
10 |
|
|
492 |
P1799G
Count Voting
|
0 / 0 |
10 |
|
|
491 |
P1799H
Tree Cutting
|
0 / 0 |
10 |
|
|
490 |
P1800A
Is It a Cat?
|
0 / 0 |
3 |
|
|
489 |
P1800B
Count the Number of Pairs
|
0 / 0 |
3 |
|
|
488 |
P1800C1
Powering the Hero (easy version)
|
0 / 0 |
3 |
|
|
487 |
P1800C2
Powering the Hero (hard version)
|
0 / 0 |
3 |
|
|
486 |
P1800D
Remove Two Letters
|
0 / 0 |
4 |
|
|
485 |
P1800E1
Unforgivable Curse (easy version)
|
0 / 0 |
4 |
|
|
484 |
P1800E2
Unforgivable Curse (hard version)
|
0 / 0 |
5 |
|
|
483 |
P1800F
Dasha and Nightmares
|
0 / 0 |
6 |
|
|
482 |
P1800G
Symmetree
|
0 / 0 |
8 |
|
|
481 |
P1801A
The Very Beautiful Blanket
|
0 / 0 |
5 |
|
|
480 |
P1801B
Buying gifts
|
0 / 0 |
6 |
|
|
479 |
P1801C
Music Festival
|
0 / 0 |
6 |
|
|
478 |
P1801D
The way home
|
0 / 0 |
7 |
|
|
477 |
P1801E
Gasoline prices
|
0 / 0 |
10 |
|
|
476 |
P1801F
Another n-dimensional chocolate bar
|
0 / 0 |
10 |
|
|
475 |
P1801G
A task for substrings
|
0 / 0 |
10 |
|
|
474 |
P1802A
Likes
|
0 / 0 |
3 |
|
|
473 |
P1802B
Settlement of Guinea Pigs
|
0 / 0 |
3 |
|
|
472 |
P1804A
Lame King
|
0 / 0 |
3 |
|
|
471 |
P1804B
Vaccination
|
0 / 0 |
3 |
|
|
470 |
P1804C
Pull Your Luck
|
0 / 0 |
5 |
|
|
469 |
P1804D
Accommodation
|
0 / 0 |
7 |
|
|
468 |
P1804E
Routing
|
0 / 0 |
9 |
|
|
467 |
P1804F
Approximate Diameter
|
0 / 0 |
10 |
|
|
466 |
P1804G
Flow Control
|
0 / 0 |
10 |
|
|
465 |
P1804H
Code Lock
|
0 / 0 |
10 |
|
|
464 |
P1805A
We Need the Zero
|
0 / 0 |
3 |
|
|
463 |
P1805B
The String Has a Target
|
0 / 0 |
3 |
|
|
462 |
P1805C
Place for a Selfie
|
0 / 0 |
4 |
|
|
461 |
P1805D
A Wide, Wide Graph
|
0 / 0 |
6 |
|
|
460 |
P1805E
There Should Be a Lot of Maximums
|
0 / 0 |
8 |
|
|
459 |
P1805F1
Survival of the Weakest (easy version)
|
0 / 0 |
10 |
|
|
458 |
P1805F2
Survival of the Weakest (hard version)
|
0 / 0 |
10 |
|
|
457 |
P1806A
Walking Master
|
0 / 0 |
3 |
|
|
456 |
P1806B
Mex Master
|
0 / 0 |
3 |
|
|
455 |
P1806C
Sequence Master
|
0 / 0 |
5 |
|
|
454 |
P1806D
DSU Master
|
0 / 0 |
9 |
|
|
453 |
P1806E
Tree Master
|
0 / 0 |
8 |
|
|
452 |
P1806F1
GCD Master (easy version)
|
0 / 0 |
10 |
|
|
451 |
P1806F2
GCD Master (hard version)
|
0 / 0 |
10 |
|
|
450 |
P1807A
Plus or Minus
|
0 / 0 |
3 |
|
|
449 |
P1807B
Grab the Candies
|
0 / 0 |
3 |
|
|
448 |
P1807C
Find and Replace
|
0 / 0 |
3 |
|
|
447 |
P1807D
Odd Queries
|
0 / 0 |
3 |
|
|
446 |
P1807E
Interview
|
0 / 0 |
4 |
|
|
445 |
P1807F
Bouncy Ball
|
0 / 0 |
5 |
|
|
444 |
P1807G1
Subsequence Addition (Easy Version)
|
0 / 0 |
3 |
|
|
443 |
P1807G2
Subsequence Addition (Hard Version)
|
0 / 0 |
3 |
|
|
442 |
P1808A
Lucky Numbers
|
0 / 0 |
3 |
|
|
441 |
P1808B
Playing in a Casino
|
0 / 0 |
4 |
|
|
440 |
P1808C
Unlucky Numbers
|
0 / 0 |
6 |
|
|
439 |
P1808D
Petya, Petya, Petr, and Palindromes
|
0 / 0 |
7 |
|
|
438 |
P1808E1
Minibuses on Venus (easy version)
|
0 / 0 |
8 |
