摘要： 106 miles to ChicagoTime Limit:2000MSMemory Limit:65536KTotal Submissions:2765Accepted:1328Special JudgeDescriptionIn the movie "Blues Brothers", the orphanage where Elwood and Jack were raised may be sold to the Board of Education if they do not pay 5000 dollars in taxes at the Cook Count 阅读全文

摘要： Hardwood SpeciesTime Limit:10000MSMemory Limit:65536KTotal Submissions:12870Accepted:5261DescriptionHardwoods are the botanical group of trees that have broad leaves, produce a fruit or nut, and generally go dormant in the winter. America's temperate climates produce forests with hundreds of har 阅读全文

摘要： Colored SticksTime Limit:5000MSMemory Limit:128000KTotal Submissions:23116Accepted:6095DescriptionYou are given a bunch of wooden sticks. Each endpoint of each stick is colored with some color. Is it possible to align the sticks in a straight line such that the colors of the endpoints that touch are 阅读全文

摘要： SequenceTime Limit:6000MSMemory Limit:65536KTotal Submissions:4906Accepted:1490DescriptionGiven m sequences, each contains n non-negative integer. Now we may select one number from each sequence to form a sequence with m integers. It's clear that we may get n ^ m this kind of sequences. Then we 阅读全文

摘要： The Water BowlsTime Limit:1000MSMemory Limit:65536KTotal Submissions:3071Accepted:1173DescriptionThe cows have a line of 20 water bowls from which they drink. The bowls can be either right-side-up (properly oriented to serve refreshing cool water) or upside-down (a position which holds no water). Th 阅读全文

摘要： Cow PhrasebookTime Limit:1000MSMemory Limit:65536KTotal Submissions:2358Accepted:796DescriptionEver theinnovator, Farmer John is teaching cows to speak some phrases in humanlanguage. He writes each new phrase the cows learn in his phrase book, a totalof M (1 <= M <= 1,000) so far.When Farmer J 阅读全文

摘要： StumpRemovalTime Limit:1000MSMemory Limit:65536KTotal Submissions:2459Accepted:1314DescriptionAlways thinking ofthe cows' grazing experience, FJ has found that he must remove N (1 <= N<= 50,000) unsightly stumps from the pasture. The stumps are convenientlyarranged in a straight line and n 阅读全文

摘要： TheMoronic CowmpouterTime Limit:1000MSMemory Limit:65536KTotal Submissions:2402Accepted:1227DescriptionInexperienced in the digital arts, the cows tried to build acalculating engine (yes, it's a cowmpouter) using binary numbers (base 2) butinstead built one based on base negative 2! They were qu 阅读全文

摘要： Regular PolygonTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others) Total Submission(s): 2203Accepted Submission(s): 682Problem DescriptionIn a 2_D plane, there is a point strictly in a regular polygon with N sides. If you are given the distances between it and N vertexes 阅读全文

摘要： Rolling HongshuTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others) Total Submission(s): 1230Accepted Submission(s): 367Problem DescriptionTo see his girl friend, sweet potato has to go over thousands of mountains. What make things worse, many bitter potatoes lives in thes 阅读全文