|
|
8456 |
P1805D
A Wide, Wide Graph
|
0 / 0 |
(无) |
|
|
8455 |
P1805E
There Should Be a Lot of Maximums
|
0 / 0 |
(无) |
|
|
8454 |
P1805F1
Survival of the Weakest (easy version)
|
0 / 0 |
(无) |
|
|
8453 |
P1805F2
Survival of the Weakest (hard version)
|
0 / 0 |
(无) |
|
|
8405 |
P1806A
Walking Master
|
0 / 0 |
3 |
|
|
8404 |
P1806B
Mex Master
|
0 / 0 |
3 |
|
|
8402 |
P1806C
Sequence Master
|
0 / 0 |
5 |
|
|
8401 |
P1806D
DSU Master
|
0 / 0 |
9 |
|
|
8403 |
P1806E
Tree Master
|
0 / 0 |
8 |
|
|
8398 |
P1806F1
GCD Master (easy version)
|
0 / 0 |
10 |
|
|
8400 |
P1806F2
GCD Master (hard version)
|
0 / 0 |
10 |
|
|
8399 |
P1807A
Plus or Minus
|
0 / 0 |
(无) |
|
|
8397 |
P1807B
Grab the Candies
|
0 / 0 |
(无) |
|
|
8395 |
P1807C
Find and Replace
|
0 / 0 |
(无) |
|
|
8396 |
P1807D
Odd Queries
|
0 / 0 |
(无) |
|
|
8394 |
P1807E
Interview
|
0 / 0 |
(无) |
|
|
8392 |
P1807F
Bouncy Ball
|
0 / 0 |
(无) |
|
|
8393 |
P1807G1
Subsequence Addition (Easy Version)
|
0 / 0 |
(无) |
|
|
8391 |
P1807G2
Subsequence Addition (Hard Version)
|
0 / 0 |
(无) |
|
|
8452 |
P1808A
Lucky Numbers
|
0 / 0 |
3 |
|
|
8450 |
P1808B
Playing in a Casino
|
0 / 0 |
4 |
|
|
8451 |
P1808C
Unlucky Numbers
|
0 / 0 |
6 |
|
|
8449 |
P1808D
Petya, Petya, Petr, and Palindromes
|
0 / 0 |
7 |
|
|
8448 |
P1808E1
Minibuses on Venus (easy version)
|
0 / 0 |
8 |
|
|
8447 |
P1808E2
Minibuses on Venus (medium version)
|
0 / 0 |
9 |
|
|
8446 |
P1808E3
Minibuses on Venus (hard version)
|
0 / 0 |
10 |
|
|
8390 |
P1809A
Garland
|
0 / 0 |
(无) |
|
|
8389 |
P1809B
Points on Plane
|
0 / 0 |
(无) |
|
|
8387 |
P1809C
Sum on Subarrays
|
0 / 0 |
(无) |
|
|
8388 |
P1809D
Binary String Sorting
|
0 / 0 |
(无) |
|
|
8386 |
P1809E
Two Tanks
|
0 / 0 |
(无) |
|
|
8385 |
P1809F
Traveling in Berland
|
0 / 0 |
(无) |
|
|
8384 |
P1809G
Prediction
|
0 / 0 |
(无) |
|
|
8445 |
P1810A
Beautiful Sequence
|
0 / 0 |
3 |
|
|
8444 |
P1810B
Candies
|
0 / 0 |
3 |
|
|
8443 |
P1810C
Make It Permutation
|
0 / 0 |
4 |
|
|
8442 |
P1810D
Climbing the Tree
|
0 / 0 |
5 |
|
|
8441 |
P1810E
Monsters
|
0 / 0 |
7 |
|
|
8440 |
P1810F
M-tree
|
0 / 0 |
10 |
|
|
8439 |
P1810G
The Maximum Prefix
|
0 / 0 |
10 |
|
|
8438 |
P1810H
Last Number
|
0 / 0 |
10 |
|
|
8565 |
P1811D
Umka and a Long Flight
|
0 / 0 |
5 |
|
|
8564 |
P1811E
Living Sequence
|
0 / 0 |
5 |
|
|
8563 |
P1811F
Is It Flower?
|
0 / 0 |
7 |
|
|
8562 |
P1811G1
Vlad and the Nice Paths (easy version)
|
0 / 0 |
7 |
|
|
8561 |
P1811G2
Vlad and the Nice Paths (hard version)
|
0 / 0 |
8 |
|
|
8437 |
P1812A
Are You a Robot?
|
0 / 0 |
(无) |
|
|
8435 |
P1812B
Was it Rated?
|
0 / 0 |
(无) |
|
|
8436 |
P1812C
Digits
|
0 / 0 |
(无) |
|
|
8434 |
P1812D
Trivial Conjecture
|
0 / 0 |
(无) |
