|
33963 |
codeforces#P1854C
Expected Destruction
|
0 / 0 |
(无) |
|
33965 |
codeforces#P1854E
Game Bundles
|
0 / 0 |
(无) |
|
33966 |
codeforces#P1854F
Mark and Spaceship
|
0 / 0 |
(无) |
|
33971 |
codeforces#P1856C
To Become Max
|
0 / 0 |
(无) |
|
33973 |
codeforces#P1856E1
PermuTree (easy version)
|
0 / 0 |
(无) |
|
33974 |
codeforces#P1856E2
PermuTree (hard version)
|
0 / 0 |
(无) |
|
33983 |
codeforces#P1858B
The Walkway
|
1 / 1 |
5 |
|
33985 |
codeforces#P1858D
Trees and Segments
|
1 / 1 |
8 |
|
33990 |
codeforces#P1859C
Another Permutation Problem
|
1 / 2 |
10 |
|
33991 |
codeforces#P1859D
Andrey and Escape from Capygrad
|
1 / 3 |
10 |
|
33992 |
codeforces#P1859E
Maximum Monogonosity
|
0 / 0 |
(无) |
|
33997 |
codeforces#P1860D
Balanced String
|
0 / 0 |
(无) |
|
34001 |
codeforces#P1861B
Two Binary Strings
|
0 / 0 |
(无) |
|
34003 |
codeforces#P1861D
Sorting By Multiplication
|
0 / 0 |
(无) |
|
34004 |
codeforces#P1861E
Non-Intersecting Subpermutations
|
0 / 0 |
(无) |
|
34011 |
codeforces#P1862F
Magic Will Save the World
|
0 / 0 |
(无) |
|
34017 |
codeforces#P1863E
Speedrun
|
0 / 0 |
(无) |
|
34018 |
codeforces#P1863F
Divide, XOR, and Conquer
|
0 / 0 |
(无) |
|
34019 |
codeforces#P1863G
Swaps
|
0 / 0 |
(无) |
|
34020 |
codeforces#P1863H
Goldberg Machine 3
|
0 / 0 |
(无) |
|
34021 |
codeforces#P1863I
Redundant Routes
|
0 / 0 |
(无) |
|
34025 |
codeforces#P1864D
Matrix Cascade
|
0 / 0 |
(无) |
|
34029 |
codeforces#P1864H
Asterism Stream
|
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 |
|
34037 |
codeforces#P1866G
Grouped Carriages
|
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 |
(无) |
|
34043 |
codeforces#P1866M
Mighty Rock Tower
|
0 / 0 |
(无) |
|
34053 |
codeforces#P1868B2
Candy Party (Hard Version)
|
0 / 0 |
(无) |
|
34054 |
codeforces#P1868C
Travel Plan
|
0 / 0 |
(无) |
|
34056 |
codeforces#P1868E
Min-Sum-Max
|
0 / 0 |
(无) |
|
34062 |
codeforces#P1870C
Colorful Table
|
0 / 0 |
(无) |
|
34064 |
codeforces#P1870E
Another MEX Problem
|
0 / 0 |
(无) |
|
34084 |
codeforces#P1874B
Jellyfish and Math
|
0 / 0 |
(无) |
|
34085 |
codeforces#P1874C
Jellyfish and EVA
|
0 / 0 |
(无) |
|
34086 |
codeforces#P1874D
Jellyfish and Miku
|
0 / 0 |
(无) |
|
34087 |
codeforces#P1874E
Jellyfish and Hack
|
0 / 0 |
(无) |
|
34088 |
codeforces#P1874F
Jellyfish and OEIS
|
0 / 0 |
(无) |
|
34089 |
codeforces#P1874G
Jellyfish and Inscryption
|
0 / 0 |
(无) |
|
34092 |
codeforces#P1875D
Jellyfish and Mex
|
0 / 0 |
(无) |
|
34097 |
codeforces#P1876E
Ball-Stackable
|
0 / 0 |
(无) |
|
34111 |
codeforces#P1879C
Make it Alternating
|
0 / 0 |
4 |
|
34112 |
codeforces#P1879D
Sum of XOR Functions
|
0 / 0 |
5 |
|
34119 |
codeforces#P1881E
Block Sequence
|
0 / 0 |
(无) |
|
34120 |
codeforces#P1881F
Minimum Maximum Distance
|
0 / 0 |
(无) |
|
34125 |
codeforces#P1882D
Tree XOR
|
0 / 0 |
(无) |
|
34130 |
codeforces#P1883C
Raspberries
|
1 / 1 |
10 |