|
|
9661 |
codeforces#P1976C Job Interview
|
0 / 0 |
(无) |
|
|
9660 |
codeforces#P1976D Invertible Bracket Sequences
|
0 / 0 |
(无) |
|
|
9706 |
codeforces#P1978B New Bakery
|
0 / 0 |
(无) |
|
|
9681 |
codeforces#P1979C Earning on Bets
|
0 / 0 |
(无) |
|
|
9679 |
codeforces#P1979E Manhattan Triangle
|
0 / 0 |
(无) |
|
|
9719 |
codeforces#P1982C Boring Day
|
0 / 0 |
(无) |
|
|
9716 |
codeforces#P1982F Sorting Problem Again
|
0 / 0 |
(无) |
|
|
9742 |
codeforces#P1983C Have Your Cake and Eat It Too
|
0 / 0 |
(无) |
|
|
9739 |
codeforces#P1983F array-value
|
0 / 0 |
(无) |
|
|
9687 |
codeforces#P1985F Final Boss
|
1 / 3 |
10 |
|
|
9709 |
codeforces#P1986G1 Permutation Problem (Simple Version)
|
0 / 0 |
(无) |
|
|
9753 |
codeforces#P1988E Range Minimum Sum
|
0 / 0 |
(无) |
|
|
9768 |
codeforces#P1990E1 Catch the Mole(Easy Version)
|
0 / 0 |
(无) |
|
|
9767 |
codeforces#P1990E2 Catch the Mole(Hard Version)
|
0 / 0 |
(无) |
|
|
9813 |
codeforces#P1993D Med-imize
|
0 / 0 |
(无) |
|
|
9763 |
codeforces#P1994C Hungry Games
|
0 / 0 |
(无) |
|
|
9785 |
codeforces#P1995B1 Bouquet (Easy Version)
|
0 / 0 |
(无) |
|
|
9784 |
codeforces#P1995B2 Bouquet (Hard Version)
|
0 / 0 |
(无) |
|
|
9774 |
codeforces#P1996F Bomb
|
0 / 0 |
(无) |
|
|
9790 |
codeforces#P1997C Even Positions
|
0 / 0 |
(无) |
|
|
9789 |
codeforces#P1997D Maximize the Root
|
0 / 0 |
(无) |
|
|
9788 |
codeforces#P1997E Level Up
|
0 / 0 |
(无) |
|
|
9851 |
codeforces#P1998C Perform Operations to Maximize Score
|
0 / 0 |
6 |
|
|
9849 |
codeforces#P1998E1 Eliminating Balls With Merging (Easy Version)
|
0 / 0 |
8 |
|
|
9848 |
codeforces#P1998E2 Eliminating Balls With Merging (Hard Version)
|
0 / 0 |
9 |
|
|
9803 |
codeforces#P1999G1 Ruler (easy version)
|
0 / 0 |
(无) |
|
|
9802 |
codeforces#P1999G2 Ruler (hard version)
|
0 / 0 |
(无) |
|
|
9841 |
codeforces#P2000G Call During the Journey
|
0 / 0 |
7 |
|
|
9840 |
codeforces#P2000H Ksyusha and the Loaded Set
|
0 / 0 |
8 |
|
|
9837 |
codeforces#P2001C Guess The Tree
|
0 / 0 |
5 |
|
|
9829 |
codeforces#P2002D2 DFS Checker (Hard Version)
|
0 / 0 |
8 |
|
|
9820 |
codeforces#P2004D Colored Portals
|
0 / 0 |
5 |
|
|
9818 |
codeforces#P2004F Make a Palindrome
|
0 / 0 |
10 |
|
|
9880 |
codeforces#P2008C Longest Good Array
|
0 / 0 |
(无) |
|
|
9876 |
codeforces#P2008G Sakurako's Task
|
0 / 0 |
(无) |
|
|
9875 |
codeforces#P2008H Sakurako's Test
|
0 / 0 |
(无) |
|
|
9870 |
codeforces#P2009E Klee's SUPER DUPER LARGE Array!!!
|
0 / 0 |
(无) |
|
|
9868 |
codeforces#P2009G1 Yunli's Subarray Queries (easy version)
|
0 / 0 |
(无) |
|
|
9867 |
codeforces#P2009G2 Yunli's Subarray Queries (hard version)
|
0 / 0 |
(无) |
