|
|
32542 |
codeforces#P1610D
Not Quite Lee
|
0 / 0 |
7 |
|
|
32586 |
codeforces#P1616D
Keep the Average High
|
0 / 0 |
7 |
|
|
32747 |
codeforces#P1646D
Weight the Tree
|
0 / 0 |
7 |
|
|
32899 |
codeforces#P1672F1
Array Shuffling
|
0 / 0 |
(无) |
|
|
32975 |
codeforces#P1685B
Linguistics
|
0 / 0 |
(无) |
|
|
33002 |
codeforces#P1690G
Count the Trains
|
1 / 5 |
10 |
|
|
33035 |
codeforces#P1696E
Placing Jinas
|
0 / 0 |
(无) |
|
|
33076 |
codeforces#P1702G2
Passable Paths (hard version)
|
0 / 0 |
7 |
|
|
33154 |
codeforces#P1716C
Robot in a Hallway
|
0 / 0 |
7 |
|
|
33155 |
codeforces#P1716D
Chip Move
|
0 / 0 |
7 |
|
|
33238 |
codeforces#P1731E
Graph Cost
|
1 / 3 |
7 |
|
|
33328 |
codeforces#P1744F
MEX vs MED
|
0 / 0 |
7 |
|
|
33626 |
codeforces#P1796D
Maximum Subarray
|
0 / 0 |
7 |
|
|
33739 |
codeforces#P1815B
Sum Graph
|
0 / 0 |
7 |
|
|
34169 |
codeforces#P1893C
Freedom of Choice
|
1 / 1 |
7 |
|
|
34246 |
codeforces#P1906F
Maximize The Value
|
1 / 12 |
7 |
|
|
34276 |
codeforces#P1910F
Build Railway Stations
|
0 / 0 |
7 |
|
|
34282 |
codeforces#P1912B
Blueprint for Seating
|
0 / 0 |
7 |
|
|
34423 |
codeforces#P1931G
One-Dimensional Puzzle
|
1 / 1 |
7 |
|
|
34580 |
codeforces#P1956D
Nene and the Mex Operator
|
0 / 0 |
7 |
|
|
34596 |
codeforces#P1958F
Narrow Paths
|
0 / 0 |
7 |
|
|
34674 |
codeforces#P1974G
Money Buys Less Happiness Now
|
0 / 1 |
7 |
|
|
34738 |
codeforces#P1984D
"a" String Problem
|
0 / 0 |
7 |
|
|
34804 |
codeforces#P1992G
Ultra-Meow
|
0 / 0 |
7 |
