|
|
9018 |
codeforces#P1866B Battling with Numbers
|
0 / 0 |
(无) |
|
|
9017 |
codeforces#P1866C Completely Searching for Inversions
|
0 / 0 |
(无) |
|
|
9016 |
codeforces#P1866D Digital Wallet
|
0 / 0 |
(无) |
|
|
9015 |
codeforces#P1866E Elevators of Tamem
|
1 / 2 |
10 |
|
|
9014 |
codeforces#P1866F Freak Joker Process
|
0 / 0 |
(无) |
|
|
9013 |
codeforces#P1866G Grouped Carriages
|
0 / 0 |
(无) |
|
|
9012 |
codeforces#P1866H Happy Sets
|
0 / 0 |
(无) |
|
|
9011 |
codeforces#P1866I Imagination Castle
|
0 / 0 |
(无) |
|
|
9010 |
codeforces#P1866J Jackets and Packets
|
0 / 0 |
(无) |
|
|
9009 |
codeforces#P1866K Keen Tree Calculation
|
0 / 0 |
(无) |
|
|
9008 |
codeforces#P1866L Lihmuf Balling
|
0 / 0 |
(无) |
|
|
9007 |
codeforces#P1866M Mighty Rock Tower
|
0 / 0 |
(无) |
|
|
9035 |
codeforces#P1867A green_gold_dog, array and permutation
|
0 / 0 |
(无) |
|
|
9034 |
codeforces#P1867B XOR Palindromes
|
0 / 0 |
(无) |
|
|
9033 |
codeforces#P1867C Salyg1n and the MEX Game
|
0 / 0 |
(无) |
|
|
9032 |
codeforces#P1867D Cyclic Operations
|
0 / 0 |
(无) |
|
|
9031 |
codeforces#P1867E1 Salyg1n and Array (simple version)
|
0 / 0 |
(无) |
|
|
9030 |
codeforces#P1867E2 Salyg1n and Array (hard version)
|
0 / 0 |
(无) |
|
|
9029 |
codeforces#P1867F Most Different Tree
|
0 / 0 |
(无) |
|
|
9028 |
codeforces#P1868A Fill in the Matrix
|
0 / 0 |
(无) |
|
|
9027 |
codeforces#P1868B1 Candy Party (Easy Version)
|
0 / 0 |
(无) |
|
|
9026 |
codeforces#P1868B2 Candy Party (Hard Version)
|
0 / 0 |
(无) |
|
|
9025 |
codeforces#P1868C Travel Plan
|
0 / 0 |
(无) |
|
|
9024 |
codeforces#P1868D Flower-like Pseudotree
|
0 / 0 |
(无) |
|
|
9023 |
codeforces#P1868E Min-Sum-Max
|
0 / 0 |
(无) |
|
|
9022 |
codeforces#P1868F LIS?
|
0 / 0 |
(无) |
|
|
9021 |
codeforces#P1869A Make It Zero
|
0 / 0 |
(无) |
|
|
9020 |
codeforces#P1869B 2D Traveling
|
0 / 0 |
(无) |
|
|
9043 |
codeforces#P1870A MEXanized Array
|
0 / 0 |
(无) |
|
|
9042 |
codeforces#P1870B Friendly Arrays
|
0 / 0 |
(无) |
|
|
9041 |
codeforces#P1870C Colorful Table
|
0 / 0 |
(无) |
|
|
9040 |
codeforces#P1870D Prefix Purchase
|
0 / 0 |
(无) |
|
|
9039 |
codeforces#P1870E Another MEX Problem
|
0 / 0 |
(无) |
|
|
9038 |
codeforces#P1870F Lazy Numbers
|
0 / 0 |
(无) |
|
|
9037 |
codeforces#P1870G MEXanization
|
0 / 0 |
(无) |
|
|
9036 |
codeforces#P1870H Standard Graph Problem
|
0 / 0 |
(无) |
|
|
9006 |
codeforces#P1872A Two Vessels
|
0 / 0 |
(无) |
|
|
9005 |
codeforces#P1872B The Corridor or There and Back Again
|
0 / 0 |
(无) |
|
|
9004 |
codeforces#P1872C Non-coprime Split
|
0 / 0 |
(无) |
|
|
9003 |
codeforces#P1872D Plus Minus Permutation
|
0 / 0 |
(无) |
|
|
9002 |
codeforces#P1872E Data Structures Fan
|
0 / 0 |
(无) |
|
|
9001 |
codeforces#P1872F Selling a Menagerie
|
0 / 0 |
(无) |
|
|
9000 |
codeforces#P1872G Replace With Product
|
0 / 1 |
10 |
|
|
9070 |
codeforces#P1873A Short Sort
|
1 / 2 |
3 |
|
|
9069 |
codeforces#P1873B Good Kid
|
1 / 1 |
3 |
|
|
9068 |
codeforces#P1873C Target Practice
|
0 / 0 |
3 |
|
|
9067 |
codeforces#P1873D 1D Eraser
|
0 / 0 |
3 |
|
|
9066 |
codeforces#P1873E Building an Aquarium
|
1 / 1 |
3 |
|
|
9065 |
codeforces#P1873F Money Trees
|
1 / 1 |
4 |
|
|
9064 |
codeforces#P1873G ABBC or BACB
|
0 / 0 |
5 |
