|
|
34362 |
codeforces#P1922C
Closest Cities
|
1 / 1 |
10 |
|
|
34364 |
codeforces#P1922E
Increasing Subsequences
|
1 / 7 |
10 |
|
|
34365 |
codeforces#P1922F
Replace on Segment
|
1 / 3 |
10 |
|
|
34367 |
codeforces#P1923B
Monsters Attack!
|
0 / 0 |
(无) |
|
|
34370 |
codeforces#P1923E
Count Paths
|
1 / 2 |
10 |
|
|
34372 |
codeforces#P1924A
Did We Get Everything Covered?
|
1 / 3 |
10 |
|
|
34375 |
codeforces#P1924D
Balanced Subsequences
|
2 / 4 |
10 |
|
|
34383 |
codeforces#P1926C
Vlad and a Sum of Sum of Digits
|
0 / 0 |
(无) |
|
|
34385 |
codeforces#P1926E
Vlad and an Odd Ordering
|
0 / 0 |
(无) |
|
|
34387 |
codeforces#P1926G
Vlad and Trouble at MIT
|
0 / 0 |
(无) |
|
|
34391 |
codeforces#P1927D
Find the Different Ones!
|
1 / 2 |
4 |
|
|
34394 |
codeforces#P1927G
Paint Charges
|
0 / 0 |
8 |
|
|
34399 |
codeforces#P1928E
Modular Sequence
|
0 / 0 |
8 |
|
|
34404 |
codeforces#P1929D
Sasha and a Walk in the City
|
0 / 0 |
6 |
|
|
34405 |
codeforces#P1929E
Sasha and the Happy Tree Cutting
|
0 / 0 |
8 |
|
|
34410 |
codeforces#P1930D1
Sum over all Substrings (Easy Version)
|
0 / 0 |
(无) |
|
|
34411 |
codeforces#P1930D2
Sum over all Substrings (Hard Version)
|
0 / 0 |
(无) |
|
|
34414 |
codeforces#P1930G
Prefix Max Set Counting
|
0 / 0 |
(无) |
|
|
34424 |
codeforces#P1932A
Thorns and Coins
|
0 / 0 |
(无) |
|
|
34429 |
codeforces#P1932F
Feed Cats
|
0 / 0 |
(无) |
|
|
34436 |
codeforces#P1933F
Turtle Mission: Robot and the Earthquake
|
0 / 0 |
(无) |
|
|
34439 |
codeforces#P1934B
Yet Another Coin Problem
|
0 / 0 |
(无) |
|
|
34446 |
codeforces#P1935C
Messenger in MAC
|
1 / 1 |
10 |
|
|
34457 |
codeforces#P1937B
Binary Path
|
0 / 0 |
(无) |
|
|
34480 |
codeforces#P1941B
Rudolf and 121
|
1 / 1 |
3 |
|
|
34481 |
codeforces#P1941C
Rudolf and the Ugly String
|
0 / 0 |
3 |
|
|
34482 |
codeforces#P1941D
Rudolf and the Ball Game
|
0 / 0 |
4 |
|
|
34483 |
codeforces#P1941E
Rudolf and k Bridges
|
0 / 1 |
5 |
|
|
34490 |
codeforces#P1942D
Learning to Paint
|
0 / 0 |
(无) |
|
|
34494 |
codeforces#P1942H
Farmer John's Favorite Intern
|
0 / 0 |
(无) |
|
|
34498 |
codeforces#P1943D1
Counting Is Fun (Easy Version)
|
0 / 0 |
(无) |
|
|
34499 |
codeforces#P1943D2
Counting Is Fun (Hard Version)
|
0 / 0 |
(无) |
|
|
34502 |
codeforces#P1943F
Minimum Hamming Distance
|
0 / 0 |
(无) |
|
|
34514 |
codeforces#P1946B
Maximum Sum
|
0 / 0 |
3 |
|
|
34515 |
codeforces#P1946C
Tree Cutting
|
0 / 0 |
5 |
|
|
34517 |
codeforces#P1946E
Girl Permutation
|
0 / 0 |
8 |
|
|
34518 |
codeforces#P1946F
Nobody is needed
|
0 / 0 |
9 |
|
|
34520 |
codeforces#P1948B
Array Fix
|
0 / 0 |
(无) |
|
|
34521 |
codeforces#P1948C
Arrow Path
|
0 / 0 |
(无) |
|
|
34522 |
codeforces#P1948D
Tandem Repeats?
|
1 / 2 |
10 |
|
|
34526 |
codeforces#P1949A
Grove
|
0 / 0 |
(无) |
|
|
34540 |
codeforces#P1950D
Product of Binary Decimals
|
0 / 0 |
(无) |
|
|
34543 |
codeforces#P1950G
Shuffling Songs
|
0 / 0 |
(无) |
|
|
34551 |
codeforces#P1951H
Thanos Snap
|
0 / 0 |
(无) |
|
|
34555 |
codeforces#P1952C
They Have Fooled
|
0 / 0 |
(无) |
|
|
34566 |
codeforces#P1954D
Colored Balls
|
0 / 0 |
6 |
|
|
34568 |
codeforces#P1954F
Unique Strings
|
0 / 0 |
10 |
|
|
34574 |
codeforces#P1955F
Unfair Game
|
0 / 0 |
6 |
|
|
34575 |
codeforces#P1955G
GCD on a grid
|
0 / 0 |
6 |
|
|
34576 |
codeforces#P1955H
The Most Reckless Defense
|
0 / 0 |
8 |
