|
32683 |
codeforces#P1632C
Strange Test
|
0 / 0 |
(无) |
|
32684 |
codeforces#P1632D
New Year Concert
|
0 / 0 |
(无) |
|
32691 |
codeforces#P1633E
Spanning Tree Queries
|
0 / 0 |
(无) |
|
32709 |
codeforces#P1637E
Best Pair
|
0 / 0 |
(无) |
|
32732 |
codeforces#P1641C
Anonymity Is Important
|
1 / 2 |
10 |
|
32754 |
codeforces#P1647E
Madoka and the Sixth-graders
|
0 / 0 |
(无) |
|
32768 |
codeforces#P1650E
Rescheduling the Exam
|
0 / 0 |
(无) |
|
32774 |
codeforces#P1651D
Nearest Excluded Points
|
0 / 0 |
(无) |
|
32776 |
codeforces#P1651F
Tower Defense
|
0 / 0 |
(无) |
|
32797 |
codeforces#P1657D
For Gamers
|
0 / 0 |
(无) |
|
32809 |
codeforces#P1659C
Line Empire
|
0 / 0 |
(无) |
|
32822 |
codeforces#P1661C
Water the Trees
|
0 / 1 |
10 |
|
32825 |
codeforces#P1661F
Teleporters
|
0 / 0 |
(无) |
|
32851 |
codeforces#P1665C
Tree Infection
|
0 / 0 |
(无) |
|
32853 |
codeforces#P1665E
MinimizOR
|
1 / 1 |
10 |
|
32858 |
codeforces#P1666E
Even Split
|
0 / 0 |
9 |
|
32879 |
codeforces#P1669F
Eating Candies
|
0 / 0 |
(无) |
|
32885 |
codeforces#P1670D
Very Suspicious
|
0 / 0 |
(无) |
|
32890 |
codeforces#P1671C
Dolce Vita
|
0 / 0 |
(无) |
|
32898 |
codeforces#P1672E
notepad.exe
|
0 / 0 |
(无) |
|
32909 |
codeforces#P1673F
Anti-Theft Road Planning
|
0 / 0 |
(无) |
|
32914 |
codeforces#P1674E
Breaking the Wall
|
0 / 0 |
(无) |
|
32928 |
codeforces#P1676E
Eating Queries
|
0 / 0 |
(无) |
|
32945 |
codeforces#P1679D
Toss a Coin to Your Graph...
|
1 / 3 |
10 |
|
32950 |
codeforces#P1680C
Binary String
|
0 / 0 |
(无) |
|
32952 |
codeforces#P1680E
Moving Chips
|
0 / 0 |
(无) |
|
32985 |
codeforces#P1687D
Cute number
|
0 / 0 |
(无) |
|
33000 |
codeforces#P1690E
Price Maximization
|
0 / 0 |
(无) |
|
33002 |
codeforces#P1690G
Count the Trains
|
1 / 5 |
10 |
|
33006 |
codeforces#P1691D
Max GEQ Sum
|
0 / 0 |
(无) |
|
33013 |
codeforces#P1692E
Binary Deque
|
0 / 0 |
(无) |
|
33022 |
codeforces#P1693F
I Might Be Wrong
|
0 / 0 |
(无) |
|
33034 |
codeforces#P1696D
Permutation Graph
|
0 / 0 |
(无) |
|
33042 |
codeforces#P1697D
Guess The String
|
0 / 0 |
(无) |
|
33048 |
codeforces#P1698D
Fixed Point Guessing
|
1 / 1 |
10 |
|
33060 |
codeforces#P1700D
River Locks
|
0 / 1 |
10 |
|
33065 |
codeforces#P1701C
Schedule Management
|
0 / 0 |
(无) |
|
33066 |
codeforces#P1701D
Permutation Restoration
|
0 / 0 |
(无) |
|
33082 |
codeforces#P1703F
Yet Another Problem About Pairs Satisfying an Inequality
|
1 / 1 |
10 |
|
33097 |
codeforces#P1705E
Mark and Professor Koro
|
0 / 0 |
(无) |
|
33102 |
codeforces#P1706D1
Chopping Carrots (Easy Version)
|
0 / 0 |
(无) |
|
33104 |
codeforces#P1706E
Qpwoeirut and Vertices
|
0 / 0 |
(无) |
|
33105 |
codeforces#P1707A
Doremy's IQ
|
1 / 1 |
10 |
|
33109 |
codeforces#P1707E
Replace
|
1 / 3 |
10 |
|
33116 |
codeforces#P1709D
Rorororobot
|
0 / 0 |
(无) |
|
33120 |
codeforces#P1710B
Rain
|
0 / 0 |
(无) |
|
33123 |
codeforces#P1710E
Two Arrays
|
1 / 3 |
10 |
|
33129 |
codeforces#P1712D
Empty Graph
|
0 / 0 |
(无) |
|
33130 |
codeforces#P1712E1
LCM Sum (easy version)
|
0 / 0 |
(无) |
|
33145 |
codeforces#P1714G
Path Prefixes
|
0 / 0 |
(无) |