|
8545 |
P1861C
Queries for the Array
|
0 / 0 |
5 |
|
8546 |
P1861C
Queries for the Array
|
0 / 0 |
5 |
|
8544 |
P1861D
Sorting By Multiplication
|
0 / 0 |
6 |
|
8542 |
P1861E
Non-Intersecting Subpermutations
|
0 / 0 |
8 |
|
8543 |
P1861E
Non-Intersecting Subpermutations
|
0 / 0 |
8 |
|
8541 |
P1861F
Four Suits
|
0 / 0 |
10 |
|
8539 |
P1862A
Gift Carpet
|
0 / 0 |
3 |
|
8540 |
P1862A
Gift Carpet
|
0 / 0 |
3 |
|
8538 |
P1862B
Sequence Game
|
0 / 0 |
3 |
|
8536 |
P1862C
Flower City Fence
|
0 / 0 |
3 |
|
8537 |
P1862C
Flower City Fence
|
0 / 0 |
3 |
|
8535 |
P1862D
Ice Cream Balls
|
0 / 0 |
4 |
|
8533 |
P1862E
Kolya and Movie Theatre
|
0 / 0 |
5 |
|
8534 |
P1862E
Kolya and Movie Theatre
|
0 / 0 |
5 |
|
8532 |
P1862F
Magic Will Save the World
|
0 / 0 |
6 |
|
8530 |
P1862G
The Great Equalizer
|
0 / 0 |
7 |
|
8531 |
P1862G
The Great Equalizer
|
0 / 0 |
7 |
|
8529 |
P1863A
Channel
|
0 / 0 |
3 |
|
8527 |
P1863B
Split Sort
|
0 / 0 |
3 |
|
8528 |
P1863B
Split Sort
|
0 / 0 |
3 |
|
8526 |
P1863C
MEX Repetition
|
0 / 0 |
3 |
|
8524 |
P1863D
Two-Colored Dominoes
|
0 / 0 |
4 |
|
8525 |
P1863D
Two-Colored Dominoes
|
0 / 0 |
4 |
|
8523 |
P1863E
Speedrun
|
0 / 0 |
7 |
|
8521 |
P1863F
Divide, XOR, and Conquer
|
0 / 0 |
10 |
|
8522 |
P1863F
Divide, XOR, and Conquer
|
0 / 0 |
10 |
|
8520 |
P1863G
Swaps
|
0 / 0 |
10 |
|
8518 |
P1863H
Goldberg Machine 3
|
0 / 0 |
10 |
|
8519 |
P1863H
Goldberg Machine 3
|
0 / 0 |
10 |
|
8517 |
P1863I
Redundant Routes
|
0 / 0 |
10 |
|
8515 |
P1864A
Increasing and Decreasing
|
0 / 0 |
3 |
|
8516 |
P1864A
Increasing and Decreasing
|
0 / 0 |
3 |
|
8514 |
P1864B
Swap and Reverse
|
0 / 0 |
3 |
|
8512 |
P1864C
Divisor Chain
|
0 / 0 |
4 |
|
8513 |
P1864C
Divisor Chain
|
0 / 0 |
4 |
|
8511 |
P1864D
Matrix Cascade
|
0 / 0 |
5 |
|
8509 |
P1864E
Guess Game
|
0 / 0 |
7 |
|
8510 |
P1864E
Guess Game
|
0 / 0 |
7 |
|
8508 |
P1864F
Exotic Queries
|
0 / 0 |
8 |
|
8506 |
P1864G
Magic Square
|
0 / 0 |
10 |
|
8507 |
P1864G
Magic Square
|
0 / 0 |
10 |
|
8505 |
P1864H
Asterism Stream
|
0 / 0 |
10 |
|
8503 |
P1864I
Future Dominators
|
0 / 0 |
10 |
|
8504 |
P1864I
Future Dominators
|
0 / 0 |
10 |
|
8502 |
P1866A
Ambitious Kid
|
0 / 0 |
3 |
|
8500 |
P1866B
Battling with Numbers
|
0 / 0 |
4 |
|
8501 |
P1866B
Battling with Numbers
|
0 / 0 |
4 |
|
8499 |
P1866C
Completely Searching for Inversions
|
0 / 0 |
6 |
|
8497 |
P1866D
Digital Wallet
|
0 / 0 |
8 |
|
8498 |
P1866D
Digital Wallet
|
0 / 0 |
8 |
|
8496 |
P1866E
Elevators of Tamem
|
0 / 0 |
10 |
|
8495 |
P1866F
Freak Joker Process
|
0 / 0 |
10 |
|
8494 |
P1866G
Grouped Carriages
|
0 / 0 |
7 |
|
8493 |
P1866H
Happy Sets
|
0 / 0 |
7 |
|
8491 |
P1866I
Imagination Castle
|
0 / 0 |
8 |
|
8492 |
P1866I
Imagination Castle
|
0 / 0 |
8 |
|
8490 |
P1866J
Jackets and Packets
|
0 / 0 |
10 |
|
8488 |
P1866K
Keen Tree Calculation
|
0 / 0 |
9 |
|
8489 |
P1866K
Keen Tree Calculation
|
0 / 0 |
9 |
|
8487 |
P1866L
Lihmuf Balling
|
0 / 0 |
9 |
|
8485 |
P1866M
Mighty Rock Tower
|
0 / 0 |
9 |
|
8486 |
P1866M
Mighty Rock Tower
|
0 / 0 |
9 |
|
8484 |
P1867A
green_gold_dog, array and permutation
|
0 / 0 |
3 |
|
8482 |
P1867B
XOR Palindromes
|
0 / 0 |
3 |
|
8483 |
P1867B
XOR Palindromes
|
0 / 0 |
3 |
|
8481 |
P1867C
Salyg1n and the MEX Game
|
0 / 0 |
4 |
|
8479 |
P1867D
Cyclic Operations
|
0 / 0 |
6 |
|
8480 |
P1867D
Cyclic Operations
|
0 / 0 |
6 |
|
8477 |
P1867E1
Salyg1n and Array (simple version)
|
0 / 0 |
7 |
|
8478 |
P1867E1
Salyg1n and Array (simple version)
|
0 / 0 |
7 |
|
8475 |
P1867E2
Salyg1n and Array (hard version)
|
0 / 0 |
8 |
|
8476 |
P1867E2
Salyg1n and Array (hard version)
|
0 / 0 |
8 |
|
8473 |
P1867F
Most Different Tree
|
0 / 0 |
10 |
|
8474 |
P1867F
Most Different Tree
|
0 / 0 |
10 |
|
8472 |
P1868A
Fill in the Matrix
|
0 / 0 |
4 |
|
8471 |
P1868B1
Candy Party (Easy Version)
|
0 / 0 |
5 |
|
8469 |
P1868B2
Candy Party (Hard Version)
|
0 / 0 |
7 |
|
8470 |
P1868B2
Candy Party (Hard Version)
|
0 / 0 |
7 |
|
8468 |
P1868C
Travel Plan
|
0 / 0 |
9 |
|
8467 |
P1868D
Flower-like Pseudotree
|
0 / 0 |
10 |
|
8465 |
P1868E
Min-Sum-Max
|
0 / 0 |
10 |
|
8466 |
P1868E
Min-Sum-Max
|
0 / 0 |
10 |
|
8464 |
P1868F
LIS?
|
0 / 0 |
10 |
|
8462 |
P1869A
Make It Zero
|
0 / 0 |
3 |
|
8463 |
P1869A
Make It Zero
|
0 / 0 |
3 |
|
8461 |
P1869B
2D Traveling
|
0 / 0 |
3 |
|
8460 |
P1870A
MEXanized Array
|
0 / 0 |
3 |
|
8458 |
P1870B
Friendly Arrays
|
0 / 0 |
4 |
|
8459 |
P1870B
Friendly Arrays
|
0 / 0 |
4 |
|
8457 |
P1870C
Colorful Table
|
0 / 0 |
4 |
|
8456 |
P1870D
Prefix Purchase
|
0 / 0 |
6 |
|
8454 |
P1870E
Another MEX Problem
|
0 / 0 |
8 |
|
8455 |
P1870E
Another MEX Problem
|
0 / 0 |
8 |
|
8453 |
P1870F
Lazy Numbers
|
0 / 0 |
10 |
|
8452 |
P1870G
MEXanization
|
0 / 0 |
10 |
|
8450 |
P1870H
Standard Graph Problem
|
0 / 0 |
10 |
|
8451 |
P1870H
Standard Graph Problem
|
0 / 0 |
10 |
|
8449 |
P1872A
Two Vessels
|
0 / 0 |
3 |
|
8448 |
P1872B
The Corridor or There and Back Again
|
0 / 0 |
3 |
|
8446 |
P1872C
Non-coprime Split
|
0 / 0 |
3 |