|
|
33006 |
codeforces#P1691D
Max GEQ Sum
|
0 / 0 |
(无) |
|
|
33020 |
codeforces#P1693D
Decinc Dividing
|
0 / 0 |
(无) |
|
|
33034 |
codeforces#P1696D
Permutation Graph
|
0 / 0 |
(无) |
|
|
33061 |
codeforces#P1700E
Serega the Pirate
|
0 / 0 |
(无) |
|
|
33150 |
codeforces#P1715E
Long Way Home
|
2 / 6 |
10 |
|
|
33156 |
codeforces#P1716E
Swap and Maximum Block
|
1 / 3 |
9 |
|
|
33183 |
codeforces#P1721D
Maximum AND
|
0 / 0 |
(无) |
|
|
33258 |
codeforces#P1734F
Zeros and Ones
|
0 / 0 |
(无) |
|
|
33300 |
codeforces#P1740I
Arranging Crystal Balls
|
0 / 0 |
(无) |
|
|
33346 |
codeforces#P1748E
Yet Another Array Counting Problem
|
0 / 1 |
8 |
|
|
33358 |
codeforces#P1750E
Bracket Cost
|
0 / 0 |
(无) |
|
|
33440 |
codeforces#P1766E
Decomposition
|
0 / 0 |
(无) |
|
|
33460 |
codeforces#P1770G
Koxia and Bracket
|
0 / 0 |
(无) |
|
|
33469 |
codeforces#P1773B
BinCoin
|
0 / 0 |
8 |
|
|
33515 |
codeforces#P1777F
Comfortably Numb
|
0 / 0 |
(无) |
|
|
33552 |
codeforces#P1783G
Weighed Tree Radius
|
0 / 0 |
(无) |
|
|
33570 |
codeforces#P1787I
Treasure Hunt
|
0 / 0 |
(无) |
|
|
33588 |
codeforces#P1790F
Timofey and Black-White Tree
|
0 / 0 |
(无) |
|
|
33610 |
codeforces#P1793F
Rebrending
|
1 / 1 |
10 |
|
|
33614 |
codeforces#P1794D
Counting Factorizations
|
0 / 0 |
(无) |
|
|
33626 |
codeforces#P1796D
Maximum Subarray
|
0 / 0 |
7 |
|
|
33657 |
codeforces#P1801E
Gasoline prices
|
1 / 2 |
10 |
|
|
33667 |
codeforces#P1804F
Approximate Diameter
|
0 / 0 |
(无) |
|
|
33697 |
codeforces#P1808E2
Minibuses on Venus (medium version)
|
0 / 0 |
9 |
|
|
33737 |
codeforces#P1814F
Communication Towers
|
0 / 0 |
(无) |
|
|
33750 |
codeforces#P1817E
Half-sum
|
0 / 0 |
10 |
|
|
33878 |
codeforces#P1841E
Fill the Matrix
|
0 / 0 |
(无) |
|
|
33888 |
codeforces#P1842I
Tenzing and Necklace
|
0 / 0 |
10 |
|
|
33930 |
codeforces#P1848F
Vika and Wiki
|
0 / 0 |
(无) |
|
|
33935 |
codeforces#P1849E
Max to the Right of Min
|
0 / 0 |
(无) |
|
|
33936 |
codeforces#P1849F
XOR Partition
|
0 / 0 |
(无) |
|
|
33972 |
codeforces#P1856D
More Wrong
|
0 / 0 |
(无) |
|
|
33993 |
codeforces#P1859F
Teleportation in Byteland
|
0 / 0 |
(无) |
|
|
34026 |
codeforces#P1864E
Guess Game
|
0 / 0 |
(无) |
|
|
34054 |
codeforces#P1868C
Travel Plan
|
0 / 0 |
(无) |
|
|
34112 |
codeforces#P1879D
Sum of XOR Functions
|
0 / 0 |
5 |
|
|
34149 |
codeforces#P1887D
Split
|
0 / 0 |
(无) |
|
|
34188 |
codeforces#P1896H1
Cyclic Hamming (Easy Version)
|
0 / 0 |
(无) |
|
|
34195 |
codeforces#P1898F
Vova Escapes the Matrix
|
1 / 1 |
10 |
|
|
34220 |
codeforces#P1902F
Trees and XOR Queries Again
|
0 / 0 |
9 |
|
|
34232 |
codeforces#P1904D2
Set To Max (Hard Version)
|
0 / 0 |
(无) |
|
|
34240 |
codeforces#P1905F
Field Should Not Be Empty
|
0 / 0 |
(无) |
|
|
34251 |
codeforces#P1906K
Deck-Building Game
|
0 / 0 |
9 |
|
|
34282 |
codeforces#P1912B
Blueprint for Seating
|
0 / 0 |
7 |
|
|
34296 |
codeforces#P1913D
Array Collapse
|
0 / 0 |
7 |
|
|
34313 |
codeforces#P1915F
Greetings
|
0 / 0 |
5 |
|
|
34321 |
codeforces#P1916G
Optimizations From Chelsu
|
0 / 0 |
10 |
|
|
34334 |
codeforces#P1918E
ace5 and Task Order
|
1 / 1 |
10 |
|
|
34340 |
codeforces#P1919D
01 Tree
|
1 / 2 |
7 |
|
|
34359 |
codeforces#P1921G
Mischievous Shooter
|
0 / 1 |
10 |
