|
9774 |
codeforces#P1996F Bomb
|
0 / 0 |
(无) |
|
9773 |
codeforces#P1996G Penacony
|
0 / 0 |
(无) |
|
9792 |
codeforces#P1997A Strong Password
|
0 / 0 |
(无) |
|
9791 |
codeforces#P1997B Make Three Regions
|
0 / 0 |
(无) |
|
9790 |
codeforces#P1997C Even Positions
|
0 / 0 |
(无) |
|
9789 |
codeforces#P1997D Maximize the Root
|
0 / 0 |
(无) |
|
9788 |
codeforces#P1997E Level Up
|
0 / 0 |
(无) |
|
9787 |
codeforces#P1997F Chips on a Line
|
0 / 0 |
(无) |
|
9853 |
codeforces#P1998A Find K Distinct Points with Fixed Center
|
0 / 0 |
3 |
|
9852 |
codeforces#P1998B Minimize Equal Sum Subarrays
|
0 / 0 |
3 |
|
9851 |
codeforces#P1998C Perform Operations to Maximize Score
|
0 / 0 |
6 |
|
9850 |
codeforces#P1998D Determine Winning Islands in Race
|
1 / 1 |
7 |
|
9849 |
codeforces#P1998E1 Eliminating Balls With Merging (Easy Version)
|
0 / 0 |
8 |
|
9848 |
codeforces#P1998E2 Eliminating Balls With Merging (Hard Version)
|
0 / 0 |
9 |
|
9809 |
codeforces#P1999A A+B Again?
|
2 / 2 |
10 |
|
9808 |
codeforces#P1999B Card Game
|
0 / 6 |
10 |
|
9807 |
codeforces#P1999C Showering
|
2 / 6 |
10 |
|
9806 |
codeforces#P1999D Slavic's Exam
|
0 / 0 |
(无) |
|
9805 |
codeforces#P1999E Triple Operations
|
0 / 0 |
(无) |
|
9804 |
codeforces#P1999F Expected Median
|
0 / 0 |
(无) |
|
9803 |
codeforces#P1999G1 Ruler (easy version)
|
0 / 0 |
(无) |
|
9802 |
codeforces#P1999G2 Ruler (hard version)
|
0 / 0 |
(无) |
|
9847 |
codeforces#P2000A Primary Task
|
0 / 0 |
3 |
|
9846 |
codeforces#P2000B Seating in a Bus
|
0 / 0 |
3 |
|
9845 |
codeforces#P2000C Numeric String Template
|
0 / 0 |
3 |
|
9844 |
codeforces#P2000D Right Left Wrong
|
0 / 0 |
4 |
|
9843 |
codeforces#P2000E Photoshoot for Gorillas
|
0 / 0 |
4 |
|
9842 |
codeforces#P2000F Color Rows and Columns
|
0 / 0 |
6 |
|
9841 |
codeforces#P2000G Call During the Journey
|
0 / 0 |
7 |
|
9840 |
codeforces#P2000H Ksyusha and the Loaded Set
|
0 / 0 |
8 |
|
9839 |
codeforces#P2001A Make All Equal
|
0 / 0 |
3 |
|
9838 |
codeforces#P2001B Generate Permutation
|
0 / 0 |
3 |
|
9837 |
codeforces#P2001C Guess The Tree
|
0 / 0 |
5 |
|
9836 |
codeforces#P2001D Longest Max Min Subsequence
|
0 / 0 |
6 |
|
9835 |
codeforces#P2001E1 Deterministic Heap (Easy Version)
|
0 / 0 |
9 |
|
9834 |
codeforces#P2001E2 Deterministic Heap (Hard Version)
|
0 / 0 |
10 |
|
9833 |
codeforces#P2002A Distanced Coloring
|
0 / 0 |
3 |
|
9832 |
codeforces#P2002B Removals Game
|
0 / 0 |
3 |
|
9831 |
codeforces#P2002C Black Circles
|
0 / 0 |
4 |
|
9830 |
codeforces#P2002D1 DFS Checker (Easy Version)
|
0 / 0 |
6 |
|
9829 |
codeforces#P2002D2 DFS Checker (Hard Version)
|
0 / 0 |
8 |
|
9828 |
codeforces#P2002E Cosmic Rays
|
0 / 0 |
8 |
|
9827 |
codeforces#P2002F1 Court Blue (Easy Version)
|
0 / 0 |
10 |
|
9826 |
codeforces#P2002F2 Court Blue (Hard Version)
|
0 / 0 |
10 |
|
9825 |
codeforces#P2002G Lattice Optimizing
|
0 / 0 |
10 |
|
9824 |
codeforces#P2002H Counting 101
|
0 / 0 |
10 |
|
9861 |
codeforces#P2003A Turtle and Good Strings
|
0 / 0 |
(无) |
|
9860 |
codeforces#P2003B Turtle and Piggy Are Playing a Game 2
|
0 / 0 |
(无) |
|
9859 |
codeforces#P2003C Turtle and Good Pairs
|
0 / 0 |
(无) |
|
9858 |
codeforces#P2003D1 Turtle and a MEX Problem (Easy Version)
|
0 / 0 |
(无) |