摘要: Largest prime factorhttp://acm.hdu.edu.cn/game/entry/problem/show.php?chapterid=2&sectionid=1&problemid=5Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2728 Accepted Submission(s): 860Problem DescriptionEverybody knows any number can be c 阅读全文
posted @ 2013-01-03 11:10 Jack Ge 阅读(354) 评论(0) 推荐(0) 编辑
摘要: 小数化分数2http://acm.hdu.edu.cn/game/entry/problem/show.php?chapterid=2&sectionid=1&problemid=12Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1646 Accepted Submission(s): 613Problem DescriptionRay 在数学课上听老师说,任何小数都能表示成分数的形式,他开始了化了起来,很快他就完成了,但他 阅读全文
posted @ 2013-01-02 22:55 Jack Ge 阅读(507) 评论(0) 推荐(0) 编辑
摘要: 相遇周期http://acm.hdu.edu.cn/game/entry/problem/show.php?chapterid=2&sectionid=1&problemid=3Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1501 Accepted Submission(s): 710Problem Description 2007年3月26日,在中俄两国元首的见证下,中国国家航天局局长孙来燕与俄罗斯联邦航天局局长别尔米诺 阅读全文
posted @ 2013-01-02 17:06 Jack Ge 阅读(1195) 评论(0) 推荐(0) 编辑
摘要: Wooden Stickshttp://acm.hdu.edu.cn/game/entry/problem/show.php?chapterid=1&sectionid=3&problemid=16Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1480 Accepted Submission(s): 595Problem Description There is a pile of n wooden sticks. The 阅读全文
posted @ 2013-01-02 16:13 Jack Ge 阅读(946) 评论(0) 推荐(0) 编辑
摘要: Moving Tableshttp://acm.hdu.edu.cn/game/entry/problem/show.php?chapterid=1&sectionid=3&problemid=2Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2435 Accepted Submission(s): 711Problem DescriptionThe famous ACM (Advanced Computer Maker) C 阅读全文
posted @ 2013-01-02 14:30 Jack Ge 阅读(417) 评论(0) 推荐(0) 编辑
摘要: 畅通工程续http://acm.hdu.edu.cn/showproblem.php?pid=1874Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 15713 Accepted Submission(s): 5371 Problem Description某省自从实行了很多年的畅通工程计划后,终于修建了很多路。不过路多了也不好,每次要从一个城镇到另一个城镇时,都有许多种道路方案可以选择,而某些方案要比另一些方案行走的距离要短很多。这让行人 阅读全文
posted @ 2013-01-01 16:15 Jack Ge 阅读(5872) 评论(1) 推荐(1) 编辑
摘要: ---恢复内容开始---Lucky Transformationhttp://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=2538Time Limit: 1000MS Memory limit: 65536K题目描述ZYJ非常喜欢幸运数字4,和7,他认为只要是只含有4和7的数字就是幸运的。比如,4,47,4477,7都是幸运的,427就不是。 现在有一个n位没有前导零的数字d,从最高位认为是第一位。ZYJ想看看这个数字能否经得起变化.如果这个数字里面有一个连着的“47”,那么就做这样的操作:如果4的位数 阅读全文
posted @ 2013-01-01 15:54 Jack Ge 阅读(250) 评论(0) 推荐(0) 编辑
摘要: 1、cin 1、cin.get() 2、cin.getline() 3、getline() 4、gets() 5、getchar()1、cin>> 用法1:最基本,也是最常用的用法,输入一个数字:#include <iostream> using namespace std; main () { int a,b; cin>>a>>b; cout<<a+b<<endl; }输入:2[回车]3[回车] 输出:5用法2:接受一个字符串,遇“空格”、“TAB”、“回车”都结束#include <iostream> us 阅读全文
posted @ 2012-12-30 16:47 Jack Ge 阅读(302) 评论(0) 推荐(0) 编辑
摘要: Assignmentshttp://acm.hdu.edu.cn/showproblem.php?pid=3661Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1205 Accepted Submission(s): 559 Problem DescriptionIn a factory, there are N workers to finish two types of tasks (A and B). Each type has N 阅读全文
posted @ 2012-12-29 22:58 Jack Ge 阅读(173) 评论(0) 推荐(0) 编辑
摘要: Permutation Countinghttp://acm.hdu.edu.cn/showproblem.php?pid=3664Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1001 Accepted Submission(s): 496 Problem DescriptionGiven a permutation a1, a2, … aN of {1, 2, …, N}, we define its E-value as the a 阅读全文
posted @ 2012-12-29 22:39 Jack Ge 阅读(218) 评论(0) 推荐(0) 编辑