|
|
34840 |
codeforces#P1998A
Find K Distinct Points with Fixed Center
|
0 / 0 |
3 |
|
|
34841 |
codeforces#P1998B
Minimize Equal Sum Subarrays
|
0 / 0 |
3 |
|
|
34846 |
codeforces#P1999A
A+B Again?
|
2 / 2 |
10 |
|
|
34850 |
codeforces#P1999E
Triple Operations
|
0 / 0 |
(无) |
|
|
34851 |
codeforces#P1999F
Expected Median
|
0 / 0 |
(无) |
|
|
34854 |
codeforces#P2000A
Primary Task
|
0 / 0 |
3 |
|
|
34858 |
codeforces#P2000E
Photoshoot for Gorillas
|
0 / 0 |
4 |
|
|
34859 |
codeforces#P2000F
Color Rows and Columns
|
0 / 0 |
6 |
|
|
34866 |
codeforces#P2001E1
Deterministic Heap (Easy Version)
|
0 / 0 |
9 |
|
|
34868 |
codeforces#P2002A
Distanced Coloring
|
0 / 0 |
3 |
|
|
34870 |
codeforces#P2002C
Black Circles
|
0 / 0 |
4 |
|
|
34874 |
codeforces#P2002F1
Court Blue (Easy Version)
|
0 / 0 |
10 |
|
|
34875 |
codeforces#P2002F2
Court Blue (Hard Version)
|
0 / 0 |
10 |
|
|
34881 |
codeforces#P2003D1
Turtle and a MEX Problem (Easy Version)
|
0 / 0 |
(无) |
|
|
34882 |
codeforces#P2003D2
Turtle and a MEX Problem (Hard Version)
|
0 / 0 |
(无) |
|
|
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 |
(无) |
|
|
34886 |
codeforces#P2004A
Closest Point
|
0 / 1 |
3 |
|
|
34890 |
codeforces#P2004E
Not a Nim Problem
|
1 / 1 |
7 |
|
|
34891 |
codeforces#P2004F
Make a Palindrome
|
0 / 0 |
10 |
|
|
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 |
(无) |
|
|
34899 |
codeforces#P2007A
Dora's Set
|
0 / 1 |
10 |
|
|
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 |
(无) |
|
|
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 |
|
|
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 |
|
|
34919 |
codeforces#P2010A
Alternating Sum of Numbers
|
0 / 0 |
3 |
|
|
34920 |
codeforces#P2010B
Three Brothers
|
1 / 3 |
3 |
|
|
35704 |
codeforces#P2053A
Tender Carpenter
|
0 / 0 |
3 |
|
|
35702 |
codeforces#P2053C
Bewitching Stargazer
|
0 / 0 |
5 |
|
|
35701 |
codeforces#P2053D
Refined Product Optimality
|
0 / 0 |
5 |
|
|
35699 |
codeforces#P2053F
Earnest Matrix Complement
|
0 / 0 |
10 |
|
|
35698 |
codeforces#P2053G
Naive String Splits
|
0 / 0 |
10 |
|
|
35695 |
codeforces#P2053I2
Affectionate Arrays (Hard Version)
|
0 / 0 |
10 |
|
|
35694 |
codeforces#P2055A
Two Frogs
|
0 / 0 |
3 |
|
|
35692 |
codeforces#P2055C
The Trail
|
0 / 0 |
4 |
|
|
35691 |
codeforces#P2055D
Scarecrow
|
0 / 0 |
7 |
|
|
35689 |
codeforces#P2055F
Cosmic Divide
|
0 / 0 |
10 |
