摘要：P - Commando WarTime Limit:1000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit Status Practice UVA 11729Appoint description:Description G Commando WarInput: Standard InputOutput: Standard Output “Waiting for orders we held in the wood, word from thefront never cameBy evening the sound of . 阅读全文

摘要：O - Dragon of LoowaterTime Limit:1000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit Status Practice UVA 11292Appoint description:DescriptionDownload as PDFProblem C: The Dragon of LoowaterOnce upon a time, in the Kingdom of Loowater, a minor nuisance turned into a major problem.The sh... 阅读全文

摘要：Flying RightTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 1270Accepted: 464DescriptionFiguring that they cannot do worse than the humans have, Farmer John's cows have decided to start an airline. Being cows, they decide to cater to the heretofore-untapped market of cows as passengers. 阅读全文

摘要：SupermarketTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 6961Accepted: 2903DescriptionA supermarket has a set Prod of products on sale. It earns a profit px for each product x∈Prod sold by a deadline dx that is measured as an integral number of time units starting from the moment the sale 阅读全文

摘要：A. Homeworktime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOnce when Gerald studied in the first year at school, his teacher gave the class the following homework. She offered the students a string consisting of n small Latin letters; the task wa 阅读全文

摘要：Tian Ji -- The Horse RacingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10782Accepted Submission(s): 2992Problem DescriptionHere is a famous story in Chinese history."That was about 2300 years ago. General Tian Ji was a high official in the 阅读全文

摘要：于PAT/ACM培训的报名通知~ AssignmentsTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1075Accepted Submission(s): 488Problem DescriptionIn a factory, there are N workers to finish two types of tasks (A and B). Each type has N tasks. Each task of type A needs 阅读全文

摘要：ZOJ Problem Set - 3433Gu Jian Qi TanTime Limit: 2 Seconds Memory Limit: 65536 KBGu Jian Qi Tan is a very hot Chinese RPG in this summer vacation. SuSu is the most important role in the game. When SuSu first meet the ancient dragon QianYu, he will have a very difficult battle with QianYu. In order... 阅读全文

摘要：ZOJ Problem Set - 3410Layton's EscapeTime Limit: 2 Seconds Memory Limit: 65536 KBProfessor Layton is a renowned archaeologist from London's Gressenheller University. He and his apprentice Luke has solved various mysteries in different places.Unfortunately, Layton and Luke are trapped in a py 阅读全文

摘要：ZOJ Problem Set - 3230Solving the ProblemsTime Limit: 2 Seconds Memory Limit: 32768 KBProgramming is fun, Aaron is addicted to it. In order to improve his programming skill, he decides to solve one programming problem per day. As you know, different problems have different properties, some proble... 阅读全文

摘要：Fence RepairTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 15047Accepted: 4799DescriptionFarmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needs N (1 ≤ N ≤ 20,000) planks of wood, each having some integer length Li (1 ≤ Li ≤ 阅读全文

摘要：StripiesTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 9301Accepted: 4527DescriptionOur 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 a 阅读全文

摘要：Moving TablesTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 20479Accepted: 6717DescriptionThe famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure. The floor has 200 rooms each on the north side and south side along the corrid 阅读全文

摘要：Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in the homework after the deadline, the teacher will reduce his score of the final test. And now we assume that doing everyo 阅读全文

摘要：今年暑假不AC？”“是的。”“那你干什么呢？”“看世界杯呀，笨蛋！”“@#$%^&*%...”确实如此，世界杯来了，球迷的节日也来了，估计很多ACMer也会抛开电脑，奔向电视了。作为球迷，一定想看尽量多的完整的比赛，当然，作为新时代的好青年，你一定还会看一些其它的节目，比如新闻联播（永远不要忘记关心国家大事）、非常6+7、超级女生，以及王小丫的《开心辞典》等等，假设你已经知道了所有你喜欢看的电视节目的转播时间表，你会合理安排吗？（目标是能看尽量多的完整节目）Input输入数据包含多个测试实例，每个测试实例的第一行只有一个整数n(n<=100)，表示你喜欢看的节目的总数，然后是n行 阅读全文

摘要：FatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean.The warehouse has N rooms. The i-th room contains J[i] pounds of JavaBeans and requires F[i] pounds of cat food. FatMouse does not have to trade for all the JavaBeans in 阅读全文