|
|
4979 |
4979
Problem 1. Forklift Certified
|
0 / 0 |
(无) |
|
|
4980 |
4980
Problem 2. Lazy Sort
|
0 / 0 |
(无) |
|
|
4985 |
4985
Problem 1. Min Max Subarrays
|
0 / 0 |
(无) |
|
|
4986 |
4986
Problem 2. Transforming Pairs
|
0 / 0 |
(无) |
|
|
4991 |
4991
Problem 1. Forklift Certified
|
0 / 0 |
(无) |
|
|
4992 |
4992
Problem 2. Lazy Sort
|
0 / 0 |
(无) |
|
|
5002 |
5002
Problem 1. Forklift Certified
|
0 / 0 |
(无) |
|
|
5003 |
5003
Problem 2. Lazy Sort
|
0 / 0 |
(无) |
|
|
5004 |
5004
Problem 3. Package Pickup
|
0 / 0 |
(无) |
|
|
5014 |
5014
Problem 1. Island Vacation
|
0 / 0 |
(无) |
|
|
5015 |
5015
Problem 2. Merging Cells
|
0 / 0 |
(无) |
|
|
5016 |
5016
Problem 3. Mooball Teams III
|
0 / 0 |
(无) |
|
|
5026 |
5026
Problem 1. Lazy Cow
|
0 / 0 |
(无) |
|
|
5027 |
5027
Problem 2. Minimum Sum of Maximums
|
0 / 0 |
(无) |
|
|
5028 |
5028
Problem 3. Infinite Adventure
|
0 / 0 |
(无) |
|
|
5038 |
5038
Problem 1. Identity Theft
|
0 / 0 |
(无) |
|
|
5039 |
5039
Problem 2. Splitting Haybales
|
0 / 0 |
(无) |
|
|
5040 |
5040
Problem 3. Activating Robots
|
0 / 0 |
(无) |
|
|
5050 |
5050
Problem 1. All Pairs Similarity
|
0 / 0 |
(无) |
|
|
5051 |
5051
Problem 2. It's Mooin' Time
|
0 / 0 |
(无) |
|
|
5052 |
5052
Problem 3. Maximize Minimum Difference
|
0 / 0 |
(无) |
|
|
5062 |
5062
Problem 1. Cowntact Tracing
|
0 / 0 |
(无) |
|
|
5063 |
5063
Problem 2. A Graph Problem
|
0 / 0 |
(无) |
|
|
5064 |
5064
Problem 3. Train Scheduling
|
0 / 0 |
(无) |
|
|
5074 |
5074
Problem 1. Minimizing Haybales
|
0 / 0 |
(无) |
|
|
5075 |
5075
Problem 2. Counting Haybales
|
0 / 0 |
(无) |
|
|
5076 |
5076
Problem 3. Multiple Choice Test
|
0 / 0 |
(无) |
|
|
5086 |
5086
Problem 1. Paint by Rectangles
|
0 / 0 |
(无) |
|
|
5087 |
5087
Problem 2. Sleeping in Class
|
0 / 0 |
(无) |
|
|
5088 |
5088
Problem 3. Phone Numbers
|
0 / 0 |
(无) |
|
|
5098 |
5098
Problem 1. 262144 Revisited
|
0 / 0 |
(无) |
|
|
5099 |
5099
Problem 2. Hoof and Brain
|
0 / 0 |
(无) |
|
|
5100 |
5100
Problem 3. Up Down Subsequence
|
0 / 0 |
(无) |
|
|
5110 |
5110
Problem 1. Breakdown
|
0 / 0 |
(无) |
|
|
5111 |
5111
Problem 2. Making Friends
|
0 / 0 |
(无) |
|
|
5112 |
5112
Problem 3. Palindromes
|
0 / 0 |
(无) |
|
|
5122 |
5122
Problem 1. Sum of Distances
|
0 / 0 |
(无) |
|
|
5123 |
5123
Problem 2. Minimum Cost Paths
|
0 / 0 |
(无) |
|
|
5124 |
5124
Problem 3. Paint by Letters
|
0 / 0 |
(无) |
|
|
5134 |
5134
Problem 1. No Time to Dry
|
0 / 0 |
(无) |
|
|
5135 |
5135
Problem 2. Minimizing Edges
|
0 / 0 |
(无) |
|
|
5136 |
5136
Problem 3. Counting Graphs
|
0 / 0 |
(无) |
|
|
5146 |
5146
Problem 1. United Cows of Farmer John
|
0 / 0 |
(无) |
|
|
5147 |
5147
Problem 2. Routing Schemes
|
0 / 0 |
(无) |
|
|
5148 |
5148
Problem 3. Balanced Subsets
|
0 / 0 |
(无) |
|
|
5158 |
5158
Problem 1. Tickets
|
0 / 0 |
(无) |
|
|
5159 |
5159
Problem 2. Paired Up
|
0 / 0 |
(无) |
|
|
5160 |
5160
Problem 3. HILO
|
0 / 0 |
(无) |
|
|
5170 |
5170
Problem 1. Cave Paintings
|
0 / 0 |
(无) |
|
|
5171 |
5171
Problem 2. Non-Decreasing Subsequences
|
0 / 0 |
(无) |
