摘要：
MU PuzzleTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 299Accepted Submission(s): 157 Problem DescriptionSuppose there are the symbols M, I, and U which can be combined to produce strings of symbols called "words". We start with one wo 阅读全文
摘要：
Protecting the FlowersTime Limit:2000MSMemory Limit:65536KTotal Submissions:3290Accepted:1332DescriptionFarmer John went to cut some wood and leftN(2 ≤N≤ 100,000) cows eating the grass, as usual. When he returned, he found to his horror that the cluster of cows was in his garden eating his beautiful 阅读全文
摘要：
StripiesTime Limit:1000MSMemory Limit:30000KTotal Submissions:10373Accepted:5017DescriptionOur chemical biologists have invented a new very useful form of life called stripies (in fact, they were first called in Russian - polosatiki, but the scientists had to invent an English name to apply for an i 阅读全文
摘要：
PacketsTime Limit:1000MSMemory Limit:10000KTotal Submissions:39956Accepted:13361DescriptionA factory produces products packed in square packets of the same height h and of the sizes 1*1, 2*2, 3*3, 4*4, 5*5, 6*6. These products are always delivered to customers in the square parcels of the same heigh 阅读全文
摘要：
Yogurt factoryTime Limit:1000MSMemory Limit:65536KTotal Submissions:5472Accepted:2811DescriptionThe cows have purchased a yogurt factory that makes world-famous Yucky Yogurt. Over the next N (1 2 #include 3 4 using namespace std; 5 6 int n,s; 7 8 int main() 9 {10 int c,y,current;11 while... 阅读全文
摘要：
Cleaning ShiftsTime Limit:1000MSMemory Limit:65536KTotal Submissions:8457Accepted:2263DescriptionFarmer John is assigning some of his N (1 2 #include 3 #include 4 5 using namespace std; 6 7 typedef struct 8 { 9 int Start;10 int End;11 } COW;12 13 int n,t;14 COW cow[25010];15 16 bool cmp(C... 阅读全文