|
|
8409 |
P1807G1
Subsequence Addition (Easy Version)
|
0 / 0 |
(无) |
|
|
8408 |
P1807G2
Subsequence Addition (Hard Version)
|
0 / 0 |
(无) |
|
|
8469 |
P1808C
Unlucky Numbers
|
0 / 0 |
6 |
|
|
8463 |
P1809B
Points on Plane
|
0 / 0 |
3 |
|
|
8462 |
P1809C
Sum on Subarrays
|
0 / 0 |
5 |
|
|
8461 |
P1809D
Binary String Sorting
|
0 / 0 |
6 |
|
|
8459 |
P1809F
Traveling in Berland
|
0 / 0 |
9 |
|
|
8457 |
P1810A
Beautiful Sequence
|
0 / 0 |
3 |
|
|
8455 |
P1810C
Make It Permutation
|
0 / 0 |
4 |
|
|
8453 |
P1810E
Monsters
|
0 / 0 |
7 |
|
|
9167 |
P1837B
Comparison String
|
0 / 0 |
(无) |
|
|
9168 |
P1837C
Best Binary String
|
0 / 0 |
(无) |
|
|
9169 |
P1837D
Bracket Coloring
|
0 / 0 |
(无) |
|
|
9171 |
P1837F
Editorial for Two
|
0 / 0 |
(无) |
|
|
8584 |
P1840D
Wooden Toy Festival
|
0 / 0 |
4 |
|
|
8577 |
P1841C
Ranom Numbers
|
0 / 0 |
6 |
|
|
8576 |
P1841D
Pairs of Segments
|
0 / 0 |
7 |
|
|
8575 |
P1841E
Fill the Matrix
|
0 / 0 |
8 |
|
|
8572 |
P1842B
Tenzing and Books
|
0 / 0 |
3 |
|
|
8570 |
P1842D
Tenzing and His Animal Friends
|
0 / 0 |
6 |
|
|
8569 |
P1842E
Tenzing and Triangle
|
0 / 0 |
8 |
|
|
8568 |
P1842F
Tenzing and Tree
|
0 / 0 |
9 |
|
|
8565 |
P1842I
Tenzing and Necklace
|
0 / 0 |
10 |
|
|
8564 |
P1843A
Sasha and Array Coloring
|
0 / 0 |
3 |
|
|
8563 |
P1843B
Long Long
|
0 / 0 |
3 |
|
|
8559 |
P1843F1
Omsk Metro (simple version)
|
0 / 0 |
6 |
|
|
8555 |
P1844C
Particles
|
0 / 0 |
4 |
|
|
8554 |
P1844D
Row Major
|
0 / 0 |
4 |
|
|
8552 |
P1844F1
Min Cost Permutation (Easy Version)
|
0 / 0 |
10 |
|
|
8551 |
P1844F2
Min Cost Permutation (Hard Version)
|
0 / 0 |
10 |
|
|
8546 |
P1845C
Strong Password
|
0 / 0 |
4 |
|
|
8545 |
P1845D
Rating System
|
0 / 0 |
6 |
|
|
8540 |
P1846C
Rudolf and the Another Competition
|
0 / 0 |
4 |
|
|
8535 |
P1846G
Rudolf and CodeVid-23
|
0 / 0 |
6 |
|
|
8534 |
P1847A
The Man who became a God
|
0 / 0 |
3 |
|
|
8533 |
P1847B
Hamon Odyssey
|
0 / 0 |
3 |
|
|
8532 |
P1847C
Vampiric Powers, anyone?
|
0 / 0 |
4 |
|
|
8531 |
P1847D
Professor Higashikata
|
0 / 0 |
6 |
|
|
8529 |
P1847F
The Boss's Identity
|
0 / 0 |
9 |
|
|
8527 |
P1848B
Vika and the Bridge
|
0 / 0 |
4 |
|
|
8521 |
P1849B
Monsters
|
0 / 0 |
(无) |
|
|
8519 |
P1849D
Array Painting
|
0 / 0 |
(无) |
|
|
8517 |
P1849F
XOR Partition
|
0 / 0 |
(无) |
|
|
8513 |
P1850D
Balanced Round
|
0 / 0 |
3 |
|
|
8509 |
P1850H
The Third Letter
|
0 / 0 |
5 |
|
|
8507 |
P1851B
Parity Sort
|
0 / 0 |
(无) |
|
|
8506 |
P1851C
Tiles Comeback
|
0 / 0 |
(无) |
|
|
8503 |
P1851F
Lisa and the Martians
|
0 / 0 |
(无) |
|
|
8500 |
P1852B
Imbalanced Arrays
|
0 / 0 |
6 |
|
|
8499 |
P1852C
Ina of the Mountain
|
0 / 0 |
9 |
|
|
8498 |
P1852D
Miriany and Matchstick
|
0 / 0 |
10 |
|
|
8497 |
P1852E
Rivalries
|
0 / 0 |
10 |
|
|
8495 |
P1853A
Desorting
|
0 / 0 |
3 |
|
|
8486 |
P1855A
Dalton the Teacher
|
0 / 0 |
(无) |
|
|
8485 |
P1855B
Longest Divisors Interval
|
0 / 0 |
(无) |
|
|
8626 |
P1856E2
PermuTree (hard version)
|
0 / 0 |
10 |
|
|
8625 |
P1857A
Array Coloring
|
0 / 0 |
3 |
|
|
8624 |
P1857B
Maximum Rounding
|
0 / 0 |
3 |
|
|
8623 |
P1857C
Assembly via Minimums
|
0 / 0 |
4 |
|
|
8619 |
P1857G
Counting Graphs
|
0 / 0 |
7 |
|
|
8618 |
P1858A
Buttons
|
0 / 0 |
3 |
|
|
8617 |
P1858B
The Walkway
|
0 / 0 |
5 |
|
|
8616 |
P1858C
Yet Another Permutation Problem
|
0 / 0 |
3 |
|
|
8615 |
P1858D
Trees and Segments
|
0 / 0 |
8 |
|
|
8611 |
P1859B
Olya and Game with Arrays
|
0 / 0 |
3 |
|
|
8610 |
P1859C
Another Permutation Problem
|
0 / 0 |
4 |
|
|
8609 |
P1859D
Andrey and Escape from Capygrad
|
0 / 0 |
6 |
|
|
8605 |
P1860B
Fancy Coins
|
0 / 0 |
(无) |
|
|
8604 |
P1860C
Game on Permutation
|
0 / 0 |
(无) |
|
|
8714 |
P1861D
Sorting By Multiplication
|
0 / 0 |
6 |
|
|
8712 |
P1861F
Four Suits
|
0 / 0 |
10 |
|
|
8600 |
P1862A
Gift Carpet
|
0 / 0 |
(无) |
|
|
8596 |
P1862E
Kolya and Movie Theatre
|
0 / 0 |
(无) |
|
|
8711 |
P1863A
Channel
|
0 / 0 |
3 |
|
|
8710 |
P1863B
Split Sort
|
0 / 0 |
3 |
|
|
8708 |
P1863D
Two-Colored Dominoes
|
0 / 0 |
4 |
|
|
8707 |
P1863E
Speedrun
|
0 / 0 |
7 |
|
|
8593 |
P1864A
Increasing and Decreasing
|
0 / 0 |
(无) |
|
|
8592 |
P1864B
Swap and Reverse
|
0 / 0 |
(无) |
|
|
8590 |
P1864D
Matrix Cascade
|
0 / 0 |
(无) |
|
|
8585 |
P1864I
Future Dominators
|
0 / 0 |
(无) |
|
|
8699 |
P1866D
Digital Wallet
|
0 / 0 |
8 |
|
|
8696 |
P1866G
Grouped Carriages
|
0 / 0 |
7 |
|
|
8687 |
P1867C
Salyg1n and the MEX Game
|
0 / 0 |
4 |
|
|
8686 |
P1867D
Cyclic Operations
|
0 / 0 |
6 |
|
|
8683 |
P1867F
Most Different Tree
|
0 / 0 |
10 |
|
|
8681 |
P1868B1
Candy Party (Easy Version)
|
0 / 0 |
5 |
|
|
8680 |
P1868B2
Candy Party (Hard Version)
|
0 / 0 |
7 |
|
|
8678 |
P1868D
Flower-like Pseudotree
|
0 / 0 |
10 |
|
|
8677 |
P1868E
Min-Sum-Max
|
0 / 0 |
10 |
|
|
8676 |
P1868F
LIS?
|
0 / 0 |
10 |
|
|
8673 |
P1870A
MEXanized Array
|
0 / 0 |
3 |
|
|
8672 |
P1870B
Friendly Arrays
|
0 / 0 |
4 |
|
|
8670 |
P1870D
Prefix Purchase
|
0 / 0 |
6 |
|
|
8666 |
P1870H
Standard Graph Problem
|
0 / 0 |
10 |
|
|
8665 |
P1872A
Two Vessels
|
0 / 0 |
3 |
|
|
8664 |
P1872B
The Corridor or There and Back Again
|
0 / 0 |
3 |
|
|
8659 |
P1872G
Replace With Product
|
0 / 0 |
7 |
|
|
8657 |
P1873B
Good Kid
|
0 / 0 |
3 |
|
|
8655 |
P1873D
1D Eraser
|
0 / 0 |
3 |
