|
33193 |
codeforces#P1725A
Accumulation of Dominoes
|
1 / 1 |
10 |
|
33195 |
codeforces#P1725C
Circular Mirror
|
0 / 0 |
(无) |
|
33196 |
codeforces#P1725D
Deducing Sortability
|
0 / 0 |
(无) |
|
33199 |
codeforces#P1725G
Garage
|
0 / 0 |
(无) |
|
33200 |
codeforces#P1725H
Hot Black Hot White
|
0 / 0 |
(无) |
|
33206 |
codeforces#P1726A
Mainak and Array
|
1 / 1 |
10 |
|
33207 |
codeforces#P1726B
Mainak and Interesting Sequence
|
0 / 0 |
(无) |
|
33210 |
codeforces#P1726E
Almost Perfect
|
0 / 0 |
(无) |
|
33213 |
codeforces#P1726H
Mainak and the Bleeding Polygon
|
0 / 0 |
(无) |
|
33218 |
codeforces#P1728E
Red-Black Pepper
|
0 / 0 |
(无) |
|
33221 |
codeforces#P1729A
Two Elevators
|
2 / 3 |
3 |
|
33226 |
codeforces#P1729F
Kirei and the Linear Function
|
0 / 0 |
6 |
|
33229 |
codeforces#P1730B
Meeting on the Line
|
0 / 0 |
(无) |
|
33230 |
codeforces#P1730C
Minimum Notation
|
0 / 0 |
(无) |
|
33234 |
codeforces#P1731A
Joey Takes Money
|
0 / 0 |
3 |
|
33235 |
codeforces#P1731B
Kill Demodogs
|
1 / 1 |
3 |
|
33236 |
codeforces#P1731C
Even Subarrays
|
0 / 0 |
5 |
|
33238 |
codeforces#P1731E
Graph Cost
|
1 / 3 |
7 |
|
33239 |
codeforces#P1731F
Function Sum
|
0 / 0 |
9 |
|
33240 |
codeforces#P1732A
Bestie
|
0 / 0 |
3 |
|
33245 |
codeforces#P1732D2
Balance (Hard version)
|
0 / 0 |
(无) |
|
33248 |
codeforces#P1733B
Rule of League
|
0 / 0 |
(无) |
|
33250 |
codeforces#P1733D1
Zero-One (Easy Version)
|
0 / 0 |
(无) |
|
33252 |
codeforces#P1733E
Conveyor
|
0 / 0 |
(无) |
|
33253 |
codeforces#P1734A
Select Three Sticks
|
0 / 0 |
(无) |
|
33255 |
codeforces#P1734C
Removing Smallest Multiples
|
0 / 0 |
(无) |
|
33257 |
codeforces#P1734E
Rectangular Congruence
|
0 / 0 |
(无) |
|
33258 |
codeforces#P1734F
Zeros and Ones
|
0 / 0 |
(无) |
|
33259 |
codeforces#P1735A
Working Week
|
0 / 0 |
3 |
|
33260 |
codeforces#P1735B
Tea with Tangerines
|
0 / 0 |
3 |
|
33262 |
codeforces#P1735D
Meta-set
|
0 / 0 |
5 |
|
33266 |
codeforces#P1736B
Playing with GCD
|
0 / 0 |
(无) |
|
33272 |
codeforces#P1737B
Ela's Fitness and the Luxury Number
|
0 / 0 |
(无) |
|
33273 |
codeforces#P1737C
Ela and Crickets
|
0 / 0 |
(无) |
|
33276 |
codeforces#P1737F
Ela and Prime GCD
|
0 / 0 |
(无) |
|
33280 |
codeforces#P1738C
Even Number Addicts
|
0 / 1 |
10 |
|
33282 |
codeforces#P1738E
Balance Addicts
|
0 / 0 |
(无) |
|
33287 |
codeforces#P1739B
Array Recovery
|
1 / 4 |
10 |
|
33292 |
codeforces#P1740A
Factorise N+M
|
0 / 0 |
(无) |
|
33295 |
codeforces#P1740D
Knowledge Cards
|
0 / 0 |
(无) |
|
33302 |
codeforces#P1741B
Funny Permutation
|
3 / 3 |
10 |
|
33303 |
codeforces#P1741C
Minimize the Thickness
|
1 / 2 |
10 |
|
33306 |
codeforces#P1741F
Multi-Colored Segments
|
0 / 0 |
(无) |
|
33314 |
codeforces#P1742G
Orray
|
0 / 0 |
(无) |
|
33320 |
codeforces#P1743F
Intersection and Union
|
0 / 0 |
8 |
|
33321 |
codeforces#P1743G
Antifibonacci Cut
|
0 / 0 |
10 |
|
33323 |
codeforces#P1744B
Even-Odd Increments
|
0 / 0 |
3 |
|
33325 |
codeforces#P1744D
Divisibility by 2^n
|
0 / 0 |
4 |
|
33326 |
codeforces#P1744E1
Divisible Numbers (easy version)
|
0 / 0 |
5 |
|
33327 |
codeforces#P1744E2
Divisible Numbers (hard version)
|
0 / 0 |
6 |