|
32988 |
codeforces#P1688A
Cirno's Perfect Bitmasks Classroom
|
0 / 0 |
(无) |
|
32991 |
codeforces#P1689A
Lex String
|
0 / 0 |
(无) |
|
32994 |
codeforces#P1689D
Lena and Matrix
|
0 / 0 |
(无) |
|
32995 |
codeforces#P1689E
ANDfinity
|
0 / 0 |
(无) |
|
33003 |
codeforces#P1691A
Beat The Odds
|
0 / 0 |
(无) |
|
33005 |
codeforces#P1691C
Sum of Substrings
|
0 / 0 |
(无) |
|
33012 |
codeforces#P1692D
The Clock
|
0 / 0 |
(无) |
|
33014 |
codeforces#P1692F
3SUM
|
0 / 0 |
(无) |
|
33020 |
codeforces#P1693D
Decinc Dividing
|
0 / 0 |
(无) |
|
33027 |
codeforces#P1695C
Zero Path
|
0 / 0 |
(无) |
|
33028 |
codeforces#P1695D1
Tree Queries (Easy Version)
|
0 / 0 |
(无) |
|
33036 |
codeforces#P1696F
Tree Recovery
|
0 / 0 |
(无) |
|
33037 |
codeforces#P1696G
Fishingprince Plays With Array Again
|
0 / 0 |
(无) |
|
33038 |
codeforces#P1696H
Maximum Product?
|
0 / 0 |
(无) |
|
33043 |
codeforces#P1697E
Coloring
|
0 / 0 |
(无) |
|
33045 |
codeforces#P1698A
XOR Mixup
|
1 / 1 |
10 |
|
33047 |
codeforces#P1698C
3SUM Closure
|
1 / 1 |
10 |
|
33049 |
codeforces#P1698E
PermutationForces II
|
0 / 0 |
(无) |
|
33055 |
codeforces#P1699D
Almost Triple Deletions
|
0 / 0 |
(无) |
|
33061 |
codeforces#P1700E
Serega the Pirate
|
0 / 0 |
(无) |
|
33080 |
codeforces#P1703D
Double Strings
|
0 / 0 |
(无) |
|
33083 |
codeforces#P1703G
Good Key, Bad Key
|
0 / 0 |
(无) |
|
33088 |
codeforces#P1704E
Count Seconds
|
0 / 0 |
(无) |
|
33095 |
codeforces#P1705C
Mark and His Unfinished Essay
|
0 / 0 |
(无) |
|
33097 |
codeforces#P1705E
Mark and Professor Koro
|
0 / 0 |
(无) |
|
33102 |
codeforces#P1706D1
Chopping Carrots (Easy Version)
|
0 / 0 |
(无) |
|
33106 |
codeforces#P1707B
Difference Array
|
0 / 0 |
(无) |
|
33113 |
codeforces#P1709A
Three Doors
|
1 / 1 |
10 |
|
33118 |
codeforces#P1709F
Multiset of Strings
|
0 / 1 |
10 |
|
33120 |
codeforces#P1710B
Rain
|
0 / 0 |
(无) |
|
33125 |
codeforces#P1711B
Party
|
0 / 0 |
(无) |
|
33130 |
codeforces#P1712E1
LCM Sum (easy version)
|
0 / 0 |
(无) |
|
33141 |
codeforces#P1714C
Minimum Varied Number
|
3 / 3 |
10 |
|
33149 |
codeforces#P1715D
2+ doors
|
0 / 0 |
(无) |
|
33156 |
codeforces#P1716E
Swap and Maximum Block
|
1 / 3 |
9 |
|
33175 |
codeforces#P1720B
Interesting Sum
|
1 / 1 |
10 |
|
33177 |
codeforces#P1720D1
Xor-Subsequence (easy version)
|
0 / 0 |
(无) |
|
33209 |
codeforces#P1726D
Edge Split
|
0 / 0 |
(无) |
|
33229 |
codeforces#P1730B
Meeting on the Line
|
0 / 0 |
(无) |
|
33236 |
codeforces#P1731C
Even Subarrays
|
0 / 0 |
5 |
|
33237 |
codeforces#P1731D
Valiant's New Map
|
1 / 1 |
5 |
|
33239 |
codeforces#P1731F
Function Sum
|
0 / 0 |
9 |
|
33240 |
codeforces#P1732A
Bestie
|
0 / 0 |
3 |
|
33241 |
codeforces#P1732B
Ugu
|
0 / 0 |
3 |
|
33244 |
codeforces#P1732D1
Balance (Easy version)
|
0 / 0 |
(无) |
|
33253 |
codeforces#P1734A
Select Three Sticks
|
0 / 0 |
(无) |
|
33255 |
codeforces#P1734C
Removing Smallest Multiples
|
0 / 0 |
(无) |
|
33262 |
codeforces#P1735D
Meta-set
|
0 / 0 |
5 |
|
33303 |
codeforces#P1741C
Minimize the Thickness
|
1 / 2 |
10 |
|
33311 |
codeforces#P1742D
Coprime
|
0 / 0 |
(无) |