|
|
34686 |
codeforces#P1976C
Job Interview
|
0 / 0 |
(无) |
|
|
34687 |
codeforces#P1976D
Invertible Bracket Sequences
|
0 / 0 |
(无) |
|
|
34696 |
codeforces#P1978B
New Bakery
|
0 / 0 |
(无) |
|
|
34703 |
codeforces#P1979C
Earning on Bets
|
0 / 0 |
(无) |
|
|
34705 |
codeforces#P1979E
Manhattan Triangle
|
0 / 0 |
(无) |
|
|
34723 |
codeforces#P1982C
Boring Day
|
0 / 0 |
(无) |
|
|
34726 |
codeforces#P1982F
Sorting Problem Again
|
0 / 0 |
(无) |
|
|
34729 |
codeforces#P1983C
Have Your Cake and Eat It Too
|
0 / 0 |
(无) |
|
|
34732 |
codeforces#P1983F
array-value
|
0 / 0 |
(无) |
|
|
34748 |
codeforces#P1985F
Final Boss
|
1 / 3 |
10 |
|
|
34758 |
codeforces#P1986G1
Permutation Problem (Simple 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 |
(无) |
|
|
34808 |
codeforces#P1993D
Med-imize
|
0 / 0 |
(无) |
|
|
34814 |
codeforces#P1994C
Hungry Games
|
0 / 0 |
(无) |
|
|
34821 |
codeforces#P1995B1
Bouquet (Easy Version)
|
0 / 0 |
(无) |
|
|
34822 |
codeforces#P1995B2
Bouquet (Hard Version)
|
0 / 0 |
(无) |
|
|
34832 |
codeforces#P1996F
Bomb
|
0 / 0 |
(无) |
|
|
34836 |
codeforces#P1997C
Even Positions
|
0 / 0 |
(无) |
|
|
34837 |
codeforces#P1997D
Maximize the Root
|
0 / 0 |
(无) |
|
|
34838 |
codeforces#P1997E
Level Up
|
0 / 0 |
(无) |
|
|
34842 |
codeforces#P1998C
Perform Operations to Maximize Score
|
0 / 0 |
6 |
|
|
34844 |
codeforces#P1998E1
Eliminating Balls With Merging (Easy Version)
|
0 / 0 |
8 |
|
|
34845 |
codeforces#P1998E2
Eliminating Balls With Merging (Hard Version)
|
0 / 0 |
9 |
|
|
34852 |
codeforces#P1999G1
Ruler (easy version)
|
0 / 0 |
(无) |
|
|
34853 |
codeforces#P1999G2
Ruler (hard version)
|
0 / 0 |
(无) |
|
|
34860 |
codeforces#P2000G
Call During the Journey
|
0 / 0 |
7 |
|
|
34861 |
codeforces#P2000H
Ksyusha and the Loaded Set
|
0 / 0 |
8 |
|
|
34864 |
codeforces#P2001C
Guess The Tree
|
0 / 0 |
5 |
|
|
34872 |
codeforces#P2002D2
DFS Checker (Hard Version)
|
0 / 0 |
8 |
|
|
34889 |
codeforces#P2004D
Colored Portals
|
0 / 0 |
5 |
|
|
34891 |
codeforces#P2004F
Make a Palindrome
|
0 / 0 |
10 |
|
|
34904 |
codeforces#P2008C
Longest Good Array
|
0 / 0 |
(无) |
|
|
34908 |
codeforces#P2008G
Sakurako's Task
|
0 / 0 |
(无) |
|
|
34909 |
codeforces#P2008H
Sakurako's Test
|
0 / 0 |
(无) |
|
|
34914 |
codeforces#P2009E
Klee's SUPER DUPER LARGE Array!!!
|
0 / 0 |
(无) |
|
|
34916 |
codeforces#P2009G1
Yunli's Subarray Queries (easy version)
|
0 / 0 |
(无) |
|
|
34917 |
codeforces#P2009G2
Yunli's Subarray Queries (hard version)
|
0 / 0 |
(无) |
