|
|
34753 |
codeforces#P1986B
Matrix Stabilization
|
1 / 1 |
10 |
|
|
34754 |
codeforces#P1986C
Update Queries
|
0 / 0 |
(无) |
|
|
34758 |
codeforces#P1986G1
Permutation Problem (Simple Version)
|
0 / 0 |
(无) |
|
|
34759 |
codeforces#P1986G2
Permutation Problem (Hard Version)
|
0 / 0 |
(无) |
|
|
34774 |
codeforces#P1988E
Range Minimum Sum
|
0 / 1 |
10 |
|
|
34786 |
codeforces#P1990E1
Catch the Mole(Easy Version)
|
0 / 0 |
(无) |
|
|
34787 |
codeforces#P1990E2
Catch the Mole(Hard Version)
|
0 / 0 |
(无) |
|
|
34788 |
codeforces#P1990F
Polygonal Segments
|
0 / 0 |
(无) |
|
|
34822 |
codeforces#P1995B2
Bouquet (Hard Version)
|
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 |
(无) |
|
|
34836 |
codeforces#P1997C
Even Positions
|
0 / 0 |
(无) |
|
|
34838 |
codeforces#P1997E
Level Up
|
0 / 0 |
(无) |
|
|
34843 |
codeforces#P1998D
Determine Winning Islands in Race
|
1 / 1 |
7 |
|
|
34844 |
codeforces#P1998E1
Eliminating Balls With Merging (Easy Version)
|
0 / 0 |
8 |
|
|
34845 |
codeforces#P1998E2
Eliminating Balls With Merging (Hard Version)
|
0 / 0 |
9 |
|
|
34856 |
codeforces#P2000C
Numeric String Template
|
0 / 0 |
3 |
|
|
34858 |
codeforces#P2000E
Photoshoot for Gorillas
|
0 / 0 |
4 |
|
|
34861 |
codeforces#P2000H
Ksyusha and the Loaded Set
|
0 / 0 |
8 |
|
|
34865 |
codeforces#P2001D
Longest Max Min Subsequence
|
0 / 0 |
6 |
|
|
34867 |
codeforces#P2001E2
Deterministic Heap (Hard Version)
|
0 / 0 |
10 |
|
|
34871 |
codeforces#P2002D1
DFS Checker (Easy Version)
|
0 / 0 |
6 |
|
|
34872 |
codeforces#P2002D2
DFS Checker (Hard Version)
|
0 / 0 |
8 |
|
|
34873 |
codeforces#P2002E
Cosmic Rays
|
0 / 0 |
8 |
|
|
34884 |
codeforces#P2003E2
Turtle and Inversions (Hard Version)
|
0 / 0 |
(无) |
|
|
34885 |
codeforces#P2003F
Turtle and Three Sequences
|
0 / 0 |
(无) |
|
|
34889 |
codeforces#P2004D
Colored Portals
|
0 / 0 |
5 |
|
|
34891 |
codeforces#P2004F
Make a Palindrome
|
0 / 0 |
10 |
|
|
34892 |
codeforces#P2004G
Substring Compression
|
0 / 0 |
10 |
|
|
34894 |
codeforces#P2006B
Iris and the Tree
|
0 / 0 |
(无) |
|
|
34895 |
codeforces#P2006C
Eri and Expanded Sets
|
1 / 1 |
10 |
|
|
34896 |
codeforces#P2006D
Iris and Adjacent Products
|
0 / 0 |
(无) |
|
|
34897 |
codeforces#P2006E
Iris's Full Binary Tree
|
0 / 0 |
(无) |
|
|
34900 |
codeforces#P2007B
Index and Maximum Value
|
0 / 0 |
(无) |
|
|
34906 |
codeforces#P2008E
Alternating String
|
0 / 0 |
(无) |
|
|
34915 |
codeforces#P2009F
Firefly's Queries
|
0 / 0 |
(无) |
|
|
34917 |
codeforces#P2009G2
Yunli's Subarray Queries (hard version)
|
0 / 0 |
(无) |
|
|
34918 |
codeforces#P2009G3
Yunli's Subarray Queries (extreme version)
|
0 / 0 |
(无) |
