算法_hdoj
文章平均质量分 80
NJUTONY
吉林大学09级软件学院南京大学计算机研究生在读
展开
-
hdoj1086(计算线段有无焦点)
You can Solve a Geometry Problem too<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 1976 Accepted Submission(s): 914<br /><br />Problem DescriptionMany geometry(几何)problems were designe转载 2010-09-06 23:03:00 · 443 阅读 · 0 评论 -
hdoj1106排序
排序<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 14254 Accepted Submission(s): 3518<br /><br />Problem Description输入一行数字,如果我们把这行数字中的‘5’都看成空格,那么就得到一行用空格分割的若干非负整数(可能有些整数以‘0’开头,这些头部的‘0’应该原创 2011-02-21 15:39:00 · 764 阅读 · 0 评论 -
hdoj1256画8
画8<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 1290 Accepted Submission(s): 581<br /><br />Problem Description谁画8画的好,画的快,今后就发的快,学业发达,事业发达,祝大家发,发,发.<br /> <br /> Input输入的第一行为一个整数N,表示后原创 2011-02-21 21:06:00 · 750 阅读 · 0 评论 -
hdoj1009FatMouse' Trade(贪心求解)
Problem DescriptionFatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean.<br />The warehouse has N rooms. The i-th room contains J[i] pounds of JavaBeans and requires F[i] pounds原创 2011-05-12 12:21:00 · 662 阅读 · 0 评论 -
hdoj1019 Least Common Multiple(多个数求最小公倍数)
Least Common Multiple<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 10917 Accepted Submission(s): 3935<br /><br />Problem DescriptionThe least common multiple (LCM) of a set of positiv原创 2011-05-15 17:41:00 · 1045 阅读 · 0 评论 -
hdoj1049 Climbing Worm
Climbing Worm<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 5203 Accepted Submission(s): 3145<br /><br />Problem DescriptionAn inch worm is at the bottom of a well n inches deep. It ha原创 2011-05-15 17:43:00 · 718 阅读 · 0 评论 -
hdoj1014Uniform Generator模拟题
Uniform Generator<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 5729 Accepted Submission(s): 2276<br /><br />Problem DescriptionComputer simulations often require random numbers. One w原创 2011-05-28 09:45:00 · 523 阅读 · 0 评论 -
hdu1871无题(优先级队列)
无题<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)<br />Total Submission(s): 1568 Accepted Submission(s): 694<br /><br />Problem Description就要复试了,外地的考生都要在学校附近住宾馆了。假设在学校附近有C家宾馆,并且这些宾馆只有单人房,而每家宾馆的价格不一样,学生们都想找价格便宜的住原创 2011-04-16 18:31:00 · 839 阅读 · 0 评论 -
hdoj1027Ignatius and the Princess II(模拟生成字典序排列)
Ignatius and the Princess II<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 1435 Accepted Submission(s): 852<br /><br />Problem DescriptionNow our hero finds the door to the BEelzebub f原创 2011-04-28 11:00:00 · 645 阅读 · 0 评论 -
hdoj1028Ignatius and the Princess III(整数无序分划,动态规划)
Ignatius and the Princess III<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 4025 Accepted Submission(s): 2806<br /><br />Problem Description"Well, it seems the first problem is too eas原创 2011-04-29 00:38:00 · 507 阅读 · 0 评论 -
hdoj1860统计字符
统计字符<br />Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)<br />Total Submission(s): 4140 Accepted Submission(s): 2566<br /><br />Problem Description统计一个给定字符串中指定的字符出现的次数<br /> <br /> Input测试输入包含若干测试用例,每个测试用例包含2行,第1行为一个原创 2011-02-21 23:36:00 · 595 阅读 · 0 评论 -
hdoj1234开门关门
开门人和关门人<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 5260 Accepted Submission(s): 2650<br /><br />Problem Description每天第一个到机房的人要把门打开,最后一个离开的人要把门关好。现有一堆杂乱的机房签 <br />到、签离记录,请根据记录找出当天开门和原创 2011-02-21 22:07:00 · 688 阅读 · 0 评论 -
hdoj1029
Ignatius and the Princess IVTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)Total Submission(s): 5220 Accepted Submission(s): 1684Problem Description"OK, you are not too bad, em... But you can never pass the next test.原创 2010-09-06 23:10:00 · 669 阅读 · 0 评论 -
hdoj1002(大数加法)
A + B Problem II<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 60420 Accepted Submission(s): 11074<br /><br />Problem DescriptionI have a very simple problem for you. Given two integer原创 2010-09-06 23:19:00 · 780 阅读 · 0 评论 -
hdoj1004(寻找最长平台)
Let the Balloon Rise<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 24938 Accepted Submission(s): 7691<br /><br />Problem DescriptionContest time again! How excited it is to see balloon原创 2010-09-06 23:22:00 · 710 阅读 · 0 评论 -
hdoj1008(模拟题)
Elevator<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 12990 Accepted Submission(s): 6735<br /><br />Problem DescriptionThe highest building in our city has only one elevator. A reques原创 2010-09-06 23:29:00 · 540 阅读 · 0 评论 -
hdu 1200 To and Fro
To and Fro<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 1907 Accepted Submission(s): 1339<br /><br />Problem DescriptionMo and Larry have devised a way of encrypting messages. The原创 2010-12-16 14:03:00 · 540 阅读 · 0 评论 -
hdoj3782XXX定律
xxx定律Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 359 Accepted Submission(s): 258Problem Description对于一个数n,如果是偶数,就把n砍掉一半;如果是奇数,把n变成 3*n+ 1后砍掉一半,直到该数变为1为止。请计算需要经过几步才能将n变到1,具体可见样例。 Input测试包含多个用例,原创 2011-03-03 13:35:00 · 650 阅读 · 0 评论 -
hdoj3785寻找大富翁
寻找大富翁<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)<br />Total Submission(s): 361 Accepted Submission(s): 184<br /><br />Problem Description浙江桐乡乌镇共有n个人,请找出该镇上的前m个大富翁.<br /> <br /> Input输入包含多组测试用例.<br />每个用例首先包含原创 2011-03-03 14:28:00 · 695 阅读 · 0 评论 -
hdoj3784继续xxx定律
继续xxx定律<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)<br />Total Submission(s): 507 Accepted Submission(s): 133<br /><br />Problem Description当 n为3时,我们在验证xxx定律的过程中会得到一个序列,3,5,8,4,2,1,将3称为关键数,5,8,4,2称为覆盖数。现在输入n个原创 2011-03-03 14:00:00 · 734 阅读 · 0 评论 -
hdoj1107(武林)
<br />比较夸张的模拟题,今天终于过了~~~<br /> <br />#include<iostream><br />#include<cstring><br />#include<cstdlib><br />using namespace std;<br />struct player<br />{<br /> char belong;//门派<br /> int position[2];//坐标位置<br /> int ability[3];//内力,武艺,生命力<br />原创 2011-02-19 22:10:00 · 959 阅读 · 0 评论 -
hdoj1020Encoding(字符串处理,水)
Encoding<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 10081 Accepted Submission(s): 4167<br /><br />Problem DescriptionGiven a string containing only 'A' - 'Z', we could encode it usi原创 2011-04-29 15:03:00 · 530 阅读 · 0 评论