|
|
34753 |
codeforces#P1986B
Matrix Stabilization
|
1 / 1 |
10 |
|
|
34755 |
codeforces#P1986D
Mathematical Problem
|
0 / 0 |
(无) |
|
|
34758 |
codeforces#P1986G1
Permutation Problem (Simple Version)
|
0 / 0 |
(无) |
|
|
34759 |
codeforces#P1986G2
Permutation Problem (Hard Version)
|
0 / 0 |
(无) |
|
|
34764 |
codeforces#P1987E
Wonderful Tree!
|
0 / 2 |
10 |
|
|
34770 |
codeforces#P1988A
Split the Multiset
|
0 / 0 |
(无) |
|
|
34773 |
codeforces#P1988D
The Omnipotent Monster Killer
|
0 / 0 |
(无) |
|
|
34774 |
codeforces#P1988E
Range Minimum Sum
|
0 / 1 |
10 |
|
|
34777 |
codeforces#P1989B
Substring and Subsequence
|
0 / 0 |
4 |
|
|
34779 |
codeforces#P1989D
Smithing Skill
|
1 / 2 |
6 |
|
|
34782 |
codeforces#P1990A
Submission Bait
|
0 / 0 |
(无) |
|
|
34784 |
codeforces#P1990C
Mad MAD Sum
|
0 / 0 |
(无) |
|
|
34794 |
codeforces#P1991F
Triangle Formation
|
0 / 0 |
(无) |
|
|
34798 |
codeforces#P1992A
Only Pluses
|
0 / 1 |
3 |
|
|
34802 |
codeforces#P1992E
Novice's Mistake
|
0 / 0 |
5 |
|
|
34803 |
codeforces#P1992F
Valuable Cards
|
0 / 0 |
6 |
|
|
34809 |
codeforces#P1993E
Xor-Grid Problem
|
0 / 0 |
(无) |
|
|
34810 |
codeforces#P1993F1
Dyn-scripted Robot (Easy Version)
|
0 / 0 |
(无) |
|
|
34818 |
codeforces#P1994G
Minecraft
|
0 / 0 |
(无) |
|
|
34820 |
codeforces#P1995A
Diagonals
|
0 / 0 |
(无) |
|
|
34821 |
codeforces#P1995B1
Bouquet (Easy Version)
|
0 / 0 |
(无) |
|
|
34823 |
codeforces#P1995C
Squaring
|
0 / 0 |
(无) |
|
|
34824 |
codeforces#P1995D
Cases
|
0 / 0 |
(无) |
|
|
34830 |
codeforces#P1996D
Fun
|
0 / 0 |
(无) |
|
|
34831 |
codeforces#P1996E
Decode
|
0 / 0 |
(无) |
|
|
34834 |
codeforces#P1997A
Strong Password
|
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 |
|
|
34847 |
codeforces#P1999B
Card Game
|
0 / 6 |
10 |
|
|
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 |
|
|
34865 |
codeforces#P2001D
Longest Max Min Subsequence
|
0 / 0 |
6 |
|
|
34870 |
codeforces#P2002C
Black Circles
|
0 / 0 |
4 |
|
|
34871 |
codeforces#P2002D1
DFS Checker (Easy Version)
|
0 / 0 |
6 |
|
|
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 |
|
|
34876 |
codeforces#P2002G
Lattice Optimizing
|
0 / 0 |
10 |
|
|
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 |
(无) |
|
|
34887 |
codeforces#P2004B
Game with Doors
|
0 / 0 |
3 |
|
|
34889 |
codeforces#P2004D
Colored Portals
|
0 / 0 |
5 |
|
|
34890 |
codeforces#P2004E
Not a Nim Problem
|
0 / 1 |
7 |
|
|
34891 |
codeforces#P2004F
Make a Palindrome
|
0 / 0 |
10 |
|
|
34894 |
codeforces#P2006B
Iris and the Tree
|
0 / 0 |
(无) |
|
|
34897 |
codeforces#P2006E
Iris's Full Binary Tree
|
0 / 0 |
(无) |
