摘要：
A. Vasily the Bear and Triangletime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasily the bear has afavorite rectangle, it has one vertex at point(0, 0), and the opposite vertex at point(x, y). Of course, the sides of Vasya's favorite rectangl 阅读全文
摘要：
SticksTime Limit:1000MSMemory Limit:10000KTotal Submissions:115683Accepted:26614DescriptionGeorge took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the original state, but he forgot how many sticks he had originally an 阅读全文
摘要：
[Ioi2007]Miners 矿工配餐Time Limit:10 SecMemory Limit:64 MBSubmit:214Solved:128Description现有两个煤矿，每个煤矿都雇用一组矿工。采煤工作很辛苦，所以矿工们需要良好饮食。每当一辆食品车到达煤矿时，矿工们便会产出一定数量的煤。有三种类型的食品车：肉车，鱼车和面包车。 矿工们喜欢变化的食谱。如果提供的食品能够不断变化，他们的产煤量将会增加。每当一个新的食品车到达煤矿时，矿工们就会比较这种新的食品和前两次（或者少于两次，如果前面运送食品的次数不足两次）的食品，并且： • 如果这几次食品车都是同一类型的食品，则矿工们产出一 阅读全文
摘要：
Dance Dance RevolutionTime limit: 3.000 secondsMr. White, a fat man, now is crazy about a game named ``Dance, Dance, Revolution". But his dance skill isso poor that he could not dance a dance, even if he dances arduously every time. Does ``DDR" just mean hima perfect method to squander his 阅读全文
摘要：
奶牛的锻炼背景 BackgroundUSACO描述 Description奶牛Bessie有N分钟时间跑步，每分钟她可以跑步或者休息。若她在第i分钟跑步，可以跑出D_i米，同时疲倦程度增加1（初始为0）。若她在第i分钟休息，则疲倦程度减少1。无论何时，疲倦程度都不能超过M。另外，一旦她开始休息，只有当疲惫程度减为0时才能重新开始跑步。在第N分钟后，她的疲倦程度必须为0。输入格式 InputFormat第一行，两个整数，代表N和M。接下来N行，每行一个整数，代表D_i。输出格式 OutputFormatBessie想知道，她最多能跑的距离。样例输入 SampleInput[复制数据]5 2534 阅读全文
摘要：
（Step2-500题）POJ训练计划+SGU经过Step1-500题训练，接下来可以开始Step2-500题，包括POJ训练计划的298题和SGU前两章200题。需要1-1年半时间继续提高解决问题和编码实现能力，加油ACMer！任重道远Step1-500题UVaOJ+算法竞赛入门经典+挑战编程+USACO 请见：http://acm.sdut.edu.cn/bbs/read.php?tid=5321一、POJ训练计划 Moon修订 298道题集训第一天 POJ纯水题= =：17道题2017 1218 2000 1046 1218 1003 1004 10051008 1013(枚举)1207 阅读全文
摘要：
（Step1-500题）UVaOJ+算法竞赛入门经典+挑战编程+USACO下面给出的题目共计560道，去掉重复的也有近500题，作为ACMer Training Step1，用1年到1年半年时间完成。打牢基础，厚积薄发。一、UVaOJhttp://uva.onlinejudge.org西班牙Valladolid大学的程序在线评测系统，是历史最悠久、最著名的OJ。二、《算法竞赛入门经典》 刘汝佳（UVaOJ351道题）以下部分内容摘自：http://sdkdacm.5d6d.com/thread-6-1-1.html“AOAPC I”是刘汝佳（大名鼎鼎的SRbGa）写的《算法竞赛入门经典》，在书 阅读全文
摘要：
Heavy TransportationTime Limit:3000MSMemory Limit:30000KTotal Submissions:19039Accepted:5084DescriptionBackgroundHugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the place his cu 阅读全文
摘要：
ROADSTime Limit:1000MSMemory Limit:65536KTotal Submissions:9971Accepted:3706DescriptionN cities named with numbers 1 ... N are connected with one-way roads. Each road has two parameters associated with it : the road length and the toll that needs to be paid for the road (expressed in the number of c 阅读全文
摘要：
A. Valera and Xtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputValera is a little boy. Yesterday he got a huge Math hometask at school, so Valera didn't have enough time to properly learn the English alphabet for his English lesson. Unfortunat 阅读全文