|
|
34030 |
codeforces#P1864I
Future Dominators
|
0 / 0 |
(无) |
|
|
34031 |
codeforces#P1866A
Ambitious Kid
|
0 / 0 |
(无) |
|
|
34032 |
codeforces#P1866B
Battling with Numbers
|
0 / 0 |
(无) |
|
|
34033 |
codeforces#P1866C
Completely Searching for Inversions
|
0 / 0 |
(无) |
|
|
34034 |
codeforces#P1866D
Digital Wallet
|
0 / 0 |
(无) |
|
|
34035 |
codeforces#P1866E
Elevators of Tamem
|
1 / 2 |
10 |
|
|
34036 |
codeforces#P1866F
Freak Joker Process
|
0 / 0 |
(无) |
|
|
34037 |
codeforces#P1866G
Grouped Carriages
|
0 / 0 |
(无) |
|
|
34038 |
codeforces#P1866H
Happy Sets
|
0 / 0 |
(无) |
|
|
34039 |
codeforces#P1866I
Imagination Castle
|
0 / 0 |
(无) |
|
|
34040 |
codeforces#P1866J
Jackets and Packets
|
0 / 0 |
(无) |
|
|
34041 |
codeforces#P1866K
Keen Tree Calculation
|
0 / 0 |
(无) |
|
|
34042 |
codeforces#P1866L
Lihmuf Balling
|
0 / 0 |
(无) |
|
|
34043 |
codeforces#P1866M
Mighty Rock Tower
|
0 / 0 |
(无) |
|
|
34044 |
codeforces#P1867A
green_gold_dog, array and permutation
|
0 / 0 |
(无) |
|
|
34045 |
codeforces#P1867B
XOR Palindromes
|
0 / 0 |
(无) |
|
|
34046 |
codeforces#P1867C
Salyg1n and the MEX Game
|
0 / 0 |
(无) |
|
|
34047 |
codeforces#P1867D
Cyclic Operations
|
0 / 0 |
(无) |
|
|
34048 |
codeforces#P1867E1
Salyg1n and Array (simple version)
|
0 / 0 |
(无) |
|
|
34049 |
codeforces#P1867E2
Salyg1n and Array (hard version)
|
0 / 0 |
(无) |
|
|
34050 |
codeforces#P1867F
Most Different Tree
|
0 / 0 |
(无) |
|
|
34051 |
codeforces#P1868A
Fill in the Matrix
|
0 / 0 |
(无) |
|
|
34052 |
codeforces#P1868B1
Candy Party (Easy Version)
|
0 / 0 |
(无) |
|
|
34053 |
codeforces#P1868B2
Candy Party (Hard Version)
|
0 / 0 |
(无) |
|
|
34054 |
codeforces#P1868C
Travel Plan
|
0 / 0 |
(无) |
|
|
34055 |
codeforces#P1868D
Flower-like Pseudotree
|
0 / 0 |
(无) |
|
|
34056 |
codeforces#P1868E
Min-Sum-Max
|
0 / 0 |
(无) |
|
|
34057 |
codeforces#P1868F
LIS?
|
0 / 0 |
(无) |
|
|
34058 |
codeforces#P1869A
Make It Zero
|
0 / 0 |
(无) |
|
|
34059 |
codeforces#P1869B
2D Traveling
|
0 / 0 |
(无) |
|
|
34060 |
codeforces#P1870A
MEXanized Array
|
0 / 0 |
(无) |
|
|
34061 |
codeforces#P1870B
Friendly Arrays
|
0 / 0 |
(无) |
|
|
34062 |
codeforces#P1870C
Colorful Table
|
0 / 0 |
(无) |
|
|
34063 |
codeforces#P1870D
Prefix Purchase
|
0 / 0 |
(无) |
|
|
34064 |
codeforces#P1870E
Another MEX Problem
|
0 / 0 |
(无) |
|
|
34065 |
codeforces#P1870F
Lazy Numbers
|
0 / 0 |
(无) |
|
|
34066 |
codeforces#P1870G
MEXanization
|
0 / 0 |
(无) |
|
|
34067 |
codeforces#P1870H
Standard Graph Problem
|
0 / 0 |
(无) |
|
|
34068 |
codeforces#P1872A
Two Vessels
|
0 / 0 |
(无) |
|
|
34069 |
codeforces#P1872B
The Corridor or There and Back Again
|
0 / 0 |
(无) |
|
|
34070 |
codeforces#P1872C
Non-coprime Split
|
0 / 0 |
(无) |
|
|
34071 |
codeforces#P1872D
Plus Minus Permutation
|
0 / 0 |
(无) |
|
|
34072 |
codeforces#P1872E
Data Structures Fan
|
0 / 0 |
(无) |
|
|
34073 |
codeforces#P1872F
Selling a Menagerie
|
0 / 0 |
(无) |
|
|
34074 |
codeforces#P1872G
Replace With Product
|
0 / 1 |
10 |
|
|
34075 |
codeforces#P1873A
Short Sort
|
1 / 2 |
3 |
|
|
34076 |
codeforces#P1873B
Good Kid
|
1 / 1 |
3 |
|
|
34077 |
codeforces#P1873C
Target Practice
|
0 / 0 |
3 |
|
|
34078 |
codeforces#P1873D
1D Eraser
|
0 / 0 |
3 |
|
|
34079 |
codeforces#P1873E
Building an Aquarium
|
1 / 1 |
3 |
