|
|
34775 |
codeforces#P1988F
Heartbeat
|
0 / 0 |
(无) |
|
|
34777 |
codeforces#P1989B
Substring and Subsequence
|
0 / 0 |
4 |
|
|
34779 |
codeforces#P1989D
Smithing Skill
|
1 / 2 |
6 |
|
|
34780 |
codeforces#P1989E
Distance to Different
|
0 / 0 |
8 |
|
|
34785 |
codeforces#P1990D
Grid Puzzle
|
0 / 0 |
(无) |
|
|
34801 |
codeforces#P1992D
Test of Love
|
0 / 0 |
4 |
|
|
34803 |
codeforces#P1992F
Valuable Cards
|
0 / 0 |
6 |
|
|
34804 |
codeforces#P1992G
Ultra-Meow
|
0 / 0 |
7 |
|
|
34808 |
codeforces#P1993D
Med-imize
|
0 / 0 |
(无) |
|
|
34809 |
codeforces#P1993E
Xor-Grid Problem
|
0 / 0 |
(无) |
|
|
34814 |
codeforces#P1994C
Hungry Games
|
0 / 0 |
(无) |
|
|
34818 |
codeforces#P1994G
Minecraft
|
0 / 0 |
(无) |
|
|
34824 |
codeforces#P1995D
Cases
|
0 / 0 |
(无) |
|
|
34825 |
codeforces#P1995E1
Let Me Teach You a Lesson (Easy Version)
|
0 / 0 |
(无) |
|
|
34826 |
codeforces#P1995E2
Let Me Teach You a Lesson (Hard Version)
|
0 / 0 |
(无) |
|
|
34833 |
codeforces#P1996G
Penacony
|
0 / 0 |
(无) |
|
|
34837 |
codeforces#P1997D
Maximize the Root
|
0 / 0 |
(无) |
|
|
34839 |
codeforces#P1997F
Chips on a Line
|
0 / 0 |
(无) |
|
|
34843 |
codeforces#P1998D
Determine Winning Islands in Race
|
1 / 1 |
7 |
|
|
34850 |
codeforces#P1999E
Triple Operations
|
0 / 0 |
(无) |
|
|
34859 |
codeforces#P2000F
Color Rows and Columns
|
0 / 0 |
6 |
|
|
34866 |
codeforces#P2001E1
Deterministic Heap (Easy Version)
|
0 / 0 |
9 |
|
|
34867 |
codeforces#P2001E2
Deterministic Heap (Hard Version)
|
0 / 0 |
10 |
|
|
34873 |
codeforces#P2002E
Cosmic Rays
|
0 / 0 |
8 |
|
|
34874 |
codeforces#P2002F1
Court Blue (Easy Version)
|
0 / 0 |
10 |
|
|
34875 |
codeforces#P2002F2
Court Blue (Hard Version)
|
0 / 0 |
10 |
|
|
34882 |
codeforces#P2003D2
Turtle and a MEX Problem (Hard Version)
|
0 / 0 |
(无) |
|
|
34883 |
codeforces#P2003E1
Turtle and Inversions (Easy Version)
|
0 / 0 |
(无) |
|
|
34884 |
codeforces#P2003E2
Turtle and Inversions (Hard Version)
|
0 / 0 |
(无) |
|
|
34885 |
codeforces#P2003F
Turtle and Three Sequences
|
0 / 0 |
(无) |
|
|
34892 |
codeforces#P2004G
Substring Compression
|
0 / 0 |
10 |
|
|
34905 |
codeforces#P2008D
Sakurako's Hobby
|
0 / 0 |
(无) |
|
|
34906 |
codeforces#P2008E
Alternating String
|
0 / 0 |
(无) |
|
|
35704 |
codeforces#P2053A
Tender Carpenter
|
0 / 0 |
3 |
|
|
35702 |
codeforces#P2053C
Bewitching Stargazer
|
0 / 0 |
5 |
|
|
35700 |
codeforces#P2053E
Resourceful Caterpillar Sequence
|
0 / 0 |
6 |
|
|
35699 |
codeforces#P2053F
Earnest Matrix Complement
|
0 / 0 |
10 |
|
|
35696 |
codeforces#P2053I1
Affectionate Arrays (Easy Version)
|
0 / 0 |
10 |
|
|
35695 |
codeforces#P2053I2
Affectionate Arrays (Hard Version)
|
0 / 0 |
10 |
|
|
35685 |
codeforces#P2056D
Unique Median
|
0 / 0 |
8 |
|
|
35684 |
codeforces#P2056E
Nested Segments
|
0 / 0 |
9 |
|
|
35683 |
codeforces#P2056F1
Xor of Median (Easy Version)
|
0 / 0 |
10 |
|
|
35682 |
codeforces#P2056F2
Xor of Median (Hard Version)
|
0 / 0 |
10 |
|
|
35677 |
codeforces#P2057E1
Another Exercise on Graphs (Easy Version)
|
0 / 0 |
8 |
|
|
35676 |
codeforces#P2057E2
Another Exercise on Graphs (hard version)
|
0 / 0 |
9 |
|
|
35675 |
codeforces#P2057F
Formation
|
0 / 0 |
10 |
|
|
35661 |
codeforces#P2064C
Remove the Ends
|
0 / 0 |
(无) |
|
|
36059 |
codeforces#P2068D
Morse Code
|
0 / 1 |
10 |
|
|
35711 |
codeforces#P2069C
Beautiful Sequence
|
0 / 0 |
(无) |
|
|
36048 |
codeforces#P2070D
Tree Jumps
|
1 / 1 |
5 |
