懒鬼的私人泳池

ComputerTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6050 Accepted Submission(s): 3055Problem Description A school bought the first comp

Description 约翰遭受了重大的损失：蟑螂吃掉了他所有的干草，留下一群饥饿的牛．他乘着容量为C(1≤C≤50000)个单位的马车，去顿因家买一些干草． 顿因有H(1≤H≤5000)包干草，每一包都有它的体积Vi(l≤Vi≤C).约翰只能整包购买， 他最多可以运回多少体积的干草呢？ Input 第1行输入C和H，之后H行一行输入一个Vi． Output最多的可买干草

Description贝茜在珠宝店闲逛时，买到了一个中意的手镯。很自然地，她想从她收集的 N(1 <= N <= 3,402)块宝石中选出最好的那些镶在手镯上。对于第i块宝石，它的重量为W_i(1 <= W_i <= 400)，并且贝茜知道它在镶上手镯后能为自己增加的魅力值D_i(1 <= D_i <= 100)。由于贝茜只能忍受重量不超过M(1 <= M <= 12,880)的手镯，她可能无法把所

Description勤奋的Farmer John想要建造一个四面的栅栏来关住牛们。他有一块长为n（4<=n<=2500）的木板，他想把这块本板切成4块。这四块小木板可以是任何一个长度只要Farmer John能够把它们围成一个合理的四边形。他能够切出多少种不同的合理方案。注意： 只要大木板的切割点不同就当成是不同的方案（像全排列那样），不要担心另外的特殊情况，go ahead。 栅栏的面积要大于0

Doing HomeworkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6694 Accepted Submission(s): 2889Problem Description Ignatius has just come b

B-numberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3537 Accepted Submission(s): 1992Problem Description A wqb-number, or B-number for

BombTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others) Total Submission(s): 11379 Accepted Submission(s): 4044Problem Description The counter-terrorists found a t

不要62Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 27292 Accepted Submission(s): 9573Problem Description 杭州人称那些傻乎乎粘嗒嗒的人为62（音：laoer）。 杭州交通

Arithmetic SequenceTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1204 Accepted Submission(s): 526Problem Description A sequence b1,b2,⋯,b

Description 约翰和他的奶牛组建了一只乐队“后街奶牛”，现在他们正在牧场里排练．奶牛们分成一堆一堆，共N(1≤N≤1000)堆．每一堆里，30只奶牛一只踩在另一只的背上，叠成一座牛塔．牧场里还有M(1≤M≤1000)个高高的草垛． 作为出色的指挥家，约翰可以通过口哨指挥奶牛们移动．他的口哨有四个音，分别能使所有的牛塔向东南西北四个方向移动一格． 每一次，当一个牛塔到达了一个草

Description为了避免餐厅过分拥挤，FJ要求奶牛们分3批就餐。每天晚饭前，奶牛们都会在餐厅前排队入内，按FJ的设想所有第3批就餐的奶牛排在队尾，队伍的前端由设定为第1批就餐的奶牛占据，中间的位置就归第2批就餐的奶牛了。由于奶牛们不理解FJ的安排，晚饭前的排队成了一个大麻烦。 第i头奶牛有一张标明她用餐批次D_i(1 <= D_i <= 3)的卡片。虽然所有N(1 <= N <= 30,000

Description奶牛们打算通过锻炼来培养自己的运动细胞，作为其中的一员，贝茜选择的运动方式是每天进行N(1 <= N <= 10,000)分钟的晨跑。在每分钟的开始，贝茜会选择下一分钟是用来跑步还是休息。 贝茜的体力限制了她跑步的距离。更具体地，如果贝茜选择在第i分钟内跑步，她可以在这一分钟内跑D_i(1 <= D_i <= 1,000)米，并且她的疲劳度会增加 1。不过，无论何时贝茜的疲劳度

Anniversary party Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7067 Accepted: 4072 DescriptionThere is going to be a party to celebrate the 80-th Anniversary of the Ural State

C. Coloring Trees time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output ZS the Coder and Chris the Baboon has arrived at Udayland! They walked i

The All-purpose ZeroTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 279 Accepted Submission(s): 129Problem Description ?? gets an sequence

Another MeaningTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 46 Accepted Submission(s): 14Problem Description As is known to all, in many

Description 约翰的干草库存已经告罄，他打算为奶牛们采购日(1≤日≤50000)磅干草． 他知道N(1≤N≤100)个干草公司，现在用1到N给它们编号．第i个公司卖的干草包重量为Pi(1≤Pi≤5000)磅，需要的开销为Ci(l≤Ci≤5000)美元．每个干草公司的货源都十分充足，可以卖出无限多的干草包． 帮助约翰找到最小的开销来满足需要，即采购到至少H磅干草．

DescriptionFarmer John以及他的N(1 <= N <= 2,500)头奶牛打算过一条河，但他们所有的渡河工具，仅仅是一个木筏。 由于奶牛不会划船，在整个渡河过程中，FJ必须始终在木筏上。在这个基础上，木筏上的奶牛数目每增加1，FJ把木筏划到对岸就得花更多的时间。 当FJ一个人坐在木筏上，他把木筏划到对岸需要M(1 <= M <= 1000)分钟。当木筏搭载的奶牛数目从i-1增加到

Description奶牛们在被划分成N行M列(2 <= N <= 100; 2 <= M <= 100)的草地上游走，试图找到整块草地中最美味的牧草。Farmer John在某个时刻看见贝茜在位置 (R1, C1)，恰好T (0 < T <= 15)秒后，FJ又在位置(R2, C2)与贝茜撞了正着。 FJ并不知道在这T秒内贝茜是否曾经到过(R2, C2)，他能确定的只是，现在贝茜在那里。 设S为奶

DescriptionFarmer John打算将电话线引到自己的农场，但电信公司并不打算为他提供免费服务。于是，FJ必须为此向电信公司支付一定的费用。 FJ的农场周围分布着N(1 <= N <= 1,000)根按1..N顺次编号的废弃的电话线杆，任意两根电话线杆间都没有电话线相连。一共P(1 <= P <= 10,000)对电话线杆间可以拉电话线，其余的那些由于隔得太远而无法被连接。 第i对电话线

PhalanxTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 770 Accepted Submission(s): 357Problem Description Today is army day, but the servi

Making the Grade Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5028 Accepted: 2383 DescriptionA straight dirt road connects two fields on FJ’s farm, but it changes elevation mo

Balanced NumberTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 3143 Accepted Submission(s): 1439Problem Description A balanced number is a

TicketsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2082 Accepted Submission(s): 1008Problem Description Jesus, what a great movie! Thou

Monkey and BananaTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 10168 Accepted Submission(s): 5285Problem Description A group of researche

Max Sum Plus PlusTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 21290 Accepted Submission(s): 7111Problem Description Now I think you have

Round Numbers Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 10811 Accepted: 3974 DescriptionThe cows, as you know, have no fingers or thumbs and thus are unable to play Scis

Amount of Degrees Time limit: 1.0 second Memory limit: 64 MB Create a code to determine the amount of integers, lying in the set [X;Y] and being a sum of exactly K different integer degrees of B. E

Jury Compromise Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 26028 Accepted: 6828 Special Judge DescriptionIn Frobnia, a far-away country, the verdicts in court trials

1219 骑士游历 1997年 时间限制: 1 s 空间限制: 128000 KB 题目等级 : 黄金 Gold 题解 题目描述 Description 设有一个n*m的棋盘（2≤n≤50，2≤m≤50），如下图，在棋盘上有一个中国象棋马。 规定：1)马只能走日字2)马只能向右跳问给定起点x1,y1和终点x2,y2，求出马从x1,y1出发到x2,y2的合法路径条数。输入描

1014 装箱问题2001年NOIP全国联赛普及组 时间限制: 1 s 空间限制: 128000 KB 题目等级 : 黄金 Gold题目描述 Description有一个箱子容量为V（正整数，0＜＝V＜＝20000），同时有n个物品（0＜n＜＝30），每个物品有一个体积（正整数）。要求n个物品中，任取若干个装入箱内，使箱子的剩余空间为最小。 输入描述 Input Description一个整

Piggy-BankTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 16734 Accepted Submission(s): 8448Problem Description Before ACM can do anything,

最少拦截系统Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 27563 Accepted Submission(s): 10891Problem Description 某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种

FatMouse’s SpeedTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 12405 Accepted Submission(s): 5446 Special JudgeProblem Description FatMou

Treats for the Cows Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4746 Accepted: 2445 DescriptionFJ has purchased N (1 <= N <= 2000) yummy treats for the cows who get money for

Milking Time Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6318 Accepted: 2659 DescriptionBessie is such a hard-working cow. In fact, she is so focused on maximizing her produc

FatMouse and CheeseTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6778 Accepted Submission(s): 2787Problem Description FatMouse has stored

免费馅饼Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 33986 Accepted Submission(s): 11612Problem Description 都说天上不会掉馅饼，但有一天gameboy正走在回家的小径上，忽

Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 28751 Accepted Submission(s): 12841Problem Description Nowa

Common Subsequence Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 44093 Accepted: 18026 DescriptionA subsequence of a given sequence is the given sequence with some elements