|
|
34888 |
codeforces#P2004C
Splitting Items
|
0 / 1 |
3 |
|
|
34889 |
codeforces#P2004D
Colored Portals
|
0 / 0 |
5 |
|
|
34890 |
codeforces#P2004E
Not a Nim Problem
|
1 / 1 |
7 |
|
|
34891 |
codeforces#P2004F
Make a Palindrome
|
0 / 0 |
10 |
|
|
34892 |
codeforces#P2004G
Substring Compression
|
0 / 0 |
10 |
|
|
34893 |
codeforces#P2006A
Iris and Game on the Tree
|
0 / 0 |
(无) |
|
|
34894 |
codeforces#P2006B
Iris and the Tree
|
0 / 0 |
(无) |
|
|
34895 |
codeforces#P2006C
Eri and Expanded Sets
|
1 / 2 |
10 |
|
|
34896 |
codeforces#P2006D
Iris and Adjacent Products
|
0 / 0 |
(无) |
|
|
34897 |
codeforces#P2006E
Iris's Full Binary Tree
|
0 / 0 |
(无) |
|
|
34898 |
codeforces#P2006F
Dora's Paint
|
0 / 0 |
(无) |
|
|
34899 |
codeforces#P2007A
Dora's Set
|
0 / 1 |
10 |
|
|
34900 |
codeforces#P2007B
Index and Maximum Value
|
0 / 0 |
(无) |
|
|
34901 |
codeforces#P2007C
Dora and C++
|
1 / 1 |
10 |
|
|
34902 |
codeforces#P2008A
Sakurako's Exam
|
0 / 0 |
(无) |
|
|
34903 |
codeforces#P2008B
Square or Not
|
0 / 0 |
(无) |
|
|
34904 |
codeforces#P2008C
Longest Good Array
|
0 / 0 |
(无) |
|
|
34905 |
codeforces#P2008D
Sakurako's Hobby
|
0 / 0 |
(无) |
|
|
34906 |
codeforces#P2008E
Alternating String
|
0 / 0 |
(无) |
|
|
34907 |
codeforces#P2008F
Sakurako's Box
|
0 / 0 |
(无) |
|
|
34908 |
codeforces#P2008G
Sakurako's Task
|
0 / 0 |
(无) |
|
|
34909 |
codeforces#P2008H
Sakurako's Test
|
0 / 0 |
(无) |
|
|
34910 |
codeforces#P2009A
Minimize!
|
1 / 2 |
10 |
|
|
34911 |
codeforces#P2009B
osu!mania
|
0 / 0 |
(无) |
|
|
34912 |
codeforces#P2009C
The Legend of Freya the Frog
|
0 / 0 |
(无) |
|
|
34913 |
codeforces#P2009D
Satyam and Counting
|
0 / 1 |
10 |
|
|
34914 |
codeforces#P2009E
Klee's SUPER DUPER LARGE Array!!!
|
0 / 0 |
(无) |
|
|
34915 |
codeforces#P2009F
Firefly's Queries
|
0 / 1 |
10 |
|
|
34916 |
codeforces#P2009G1
Yunli's Subarray Queries (easy version)
|
0 / 0 |
(无) |
|
|
34917 |
codeforces#P2009G2
Yunli's Subarray Queries (hard version)
|
0 / 0 |
(无) |
|
|
34918 |
codeforces#P2009G3
Yunli's Subarray Queries (extreme version)
|
0 / 0 |
(无) |
|
|
34919 |
codeforces#P2010A
Alternating Sum of Numbers
|
0 / 0 |
3 |
|
|
34920 |
codeforces#P2010B
Three Brothers
|
1 / 3 |
3 |
|
|
34921 |
codeforces#P2010C1
Message Transmission Error (easy version)
|
1 / 3 |
4 |
|
|
34922 |
codeforces#P2010C2
Message Transmission Error (hard version)
|
0 / 1 |
5 |
|
|
35707 |
codeforces#P2052K
__NO_TITLE__
|
0 / 0 |
(无) |
|
|
35706 |
codeforces#P2052L
__NO_TITLE__
|
0 / 0 |
(无) |
|
|
35705 |
codeforces#P2052M
__NO_TITLE__
|
0 / 0 |
(无) |
|
|
35704 |
codeforces#P2053A
Tender Carpenter
|
0 / 0 |
3 |
|
|
35703 |
codeforces#P2053B
Outstanding Impressionist
|
0 / 0 |
4 |
|
|
35702 |
codeforces#P2053C
Bewitching Stargazer
|
0 / 0 |
5 |
|
|
35701 |
codeforces#P2053D
Refined Product Optimality
|
0 / 0 |
5 |
|
|
35700 |
codeforces#P2053E
Resourceful Caterpillar Sequence
|
0 / 0 |
6 |
|
|
35699 |
codeforces#P2053F
Earnest Matrix Complement
|
0 / 0 |
10 |
|
|
35698 |
codeforces#P2053G
Naive String Splits
|
0 / 0 |
10 |
|
|
35697 |
codeforces#P2053H
Delicate Anti-monotonous Operations
|
0 / 0 |
10 |
|
|
35696 |
codeforces#P2053I1
Affectionate Arrays (Easy Version)
|
0 / 0 |
10 |
|
|
35695 |
codeforces#P2053I2
Affectionate Arrays (Hard Version)
|
0 / 0 |
10 |
|
|
35694 |
codeforces#P2055A
Two Frogs
|
0 / 0 |
3 |
|
|
35693 |
codeforces#P2055B
Crafting
|
0 / 0 |
3 |
