|
|
33674 |
codeforces#P1805E
There Should Be a Lot of Maximums
|
0 / 0 |
(无) |
|
|
33675 |
codeforces#P1805F1
Survival of the Weakest (easy version)
|
0 / 0 |
(无) |
|
|
33676 |
codeforces#P1805F2
Survival of the Weakest (hard version)
|
0 / 0 |
(无) |
|
|
33677 |
codeforces#P1806A
Walking Master
|
1 / 2 |
10 |
|
|
33678 |
codeforces#P1806B
Mex Master
|
0 / 0 |
(无) |
|
|
33679 |
codeforces#P1806C
Sequence Master
|
1 / 4 |
10 |
|
|
33680 |
codeforces#P1806D
DSU Master
|
0 / 0 |
(无) |
|
|
33681 |
codeforces#P1806E
Tree Master
|
0 / 0 |
(无) |
|
|
33682 |
codeforces#P1806F1
GCD Master (easy version)
|
0 / 0 |
(无) |
|
|
33683 |
codeforces#P1806F2
GCD Master (hard version)
|
1 / 1 |
10 |
|
|
33684 |
codeforces#P1807A
Plus or Minus
|
0 / 0 |
(无) |
|
|
33685 |
codeforces#P1807B
Grab the Candies
|
0 / 0 |
(无) |
|
|
33686 |
codeforces#P1807C
Find and Replace
|
0 / 0 |
(无) |
|
|
33687 |
codeforces#P1807D
Odd Queries
|
0 / 0 |
(无) |
|
|
33688 |
codeforces#P1807E
Interview
|
0 / 0 |
(无) |
|
|
33689 |
codeforces#P1807F
Bouncy Ball
|
0 / 0 |
(无) |
|
|
33690 |
codeforces#P1807G1
Subsequence Addition (Easy Version)
|
0 / 0 |
(无) |
|
|
33691 |
codeforces#P1807G2
Subsequence Addition (Hard Version)
|
0 / 0 |
(无) |
|
|
33692 |
codeforces#P1808A
Lucky Numbers
|
1 / 2 |
3 |
|
|
33693 |
codeforces#P1808B
Playing in a Casino
|
0 / 0 |
4 |
|
|
33694 |
codeforces#P1808C
Unlucky Numbers
|
0 / 0 |
6 |
|
|
33695 |
codeforces#P1808D
Petya, Petya, Petr, and Palindromes
|
0 / 0 |
7 |
|
|
33696 |
codeforces#P1808E1
Minibuses on Venus (easy version)
|
0 / 0 |
8 |
|
|
33697 |
codeforces#P1808E2
Minibuses on Venus (medium version)
|
0 / 0 |
9 |
|
|
33698 |
codeforces#P1808E3
Minibuses on Venus (hard version)
|
0 / 0 |
10 |
|
|
33699 |
codeforces#P1809A
Garland
|
1 / 1 |
10 |
|
|
33700 |
codeforces#P1809B
Points on Plane
|
1 / 3 |
10 |
|
|
33701 |
codeforces#P1809C
Sum on Subarrays
|
1 / 2 |
10 |
|
|
33702 |
codeforces#P1809D
Binary String Sorting
|
1 / 1 |
10 |
|
|
33703 |
codeforces#P1809E
Two Tanks
|
1 / 1 |
10 |
|
|
33704 |
codeforces#P1809F
Traveling in Berland
|
0 / 0 |
(无) |
|
|
33705 |
codeforces#P1809G
Prediction
|
0 / 0 |
(无) |
|
|
33706 |
codeforces#P1810A
Beautiful Sequence
|
0 / 0 |
3 |
|
|
33707 |
codeforces#P1810B
Candies
|
0 / 0 |
3 |
|
|
33708 |
codeforces#P1810C
Make It Permutation
|
0 / 0 |
4 |
|
|
33709 |
codeforces#P1810D
Climbing the Tree
|
1 / 1 |
5 |
|
|
33710 |
codeforces#P1810E
Monsters
|
0 / 0 |
7 |
|
|
33711 |
codeforces#P1810F
M-tree
|
0 / 0 |
10 |
|
|
33712 |
codeforces#P1810G
The Maximum Prefix
|
0 / 0 |
10 |
|
|
33713 |
codeforces#P1810H
Last Number
|
0 / 0 |
10 |
|
|
33714 |
codeforces#P1811A
Insert Digit
|
1 / 2 |
10 |
|
|
33715 |
codeforces#P1811B
Conveyor Belts
|
0 / 0 |
(无) |
|
|
33716 |
codeforces#P1811C
Restore the Array
|
0 / 0 |
(无) |
|
|
33717 |
codeforces#P1811D
Umka and a Long Flight
|
0 / 0 |
(无) |
|
|
33718 |
codeforces#P1811E
Living Sequence
|
0 / 0 |
(无) |
|
|
33719 |
codeforces#P1811F
Is It Flower?
|
0 / 0 |
(无) |
|
|
33720 |
codeforces#P1811G1
Vlad and the Nice Paths (easy version)
|
0 / 0 |
(无) |
|
|
33721 |
codeforces#P1811G2
Vlad and the Nice Paths (hard version)
|
0 / 0 |
(无) |
|
|
33722 |
codeforces#P1812A
Are You a Robot?
|
0 / 0 |
(无) |
|
|
33723 |
codeforces#P1812B
Was it Rated?
|
0 / 0 |
(无) |
