2012年12月29日
HDU 3665 Seaside
摘要： Seasidehttp://acm.hdu.edu.cn/showproblem.php?pid=3665Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 802 Accepted Submission(s): 562 Problem DescriptionXiaoY is living in a big city, there are N towns in it and some towns near the sea. All these 阅读全文
posted @ 2012-12-29 22:02 Jack Ge 阅读(381) 评论(0) 推荐(0)
HDU 1061 Rightmost Digit (矩阵快速幂)
摘要： Rightmost Digithttp://acm.hdu.edu.cn/showproblem.php?pid=1061Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 21580 Accepted Submission(s): 8242 Problem DescriptionGiven a positive integer N, you should output the most right digit of N^N.InputThe 阅读全文
posted @ 2012-12-29 16:37 Jack Ge 阅读(207) 评论(0) 推荐(0)
HDU 1058 Humble Numbers
摘要： Humble Numbershttp://acm.hdu.edu.cn/showproblem.php?pid=1058Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 10972 Accepted Submission(s): 4780 Problem DescriptionA number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequ 阅读全文
posted @ 2012-12-29 16:19 Jack Ge 阅读(1252) 评论(0) 推荐(0)
（转）qsort完整版用法
摘要： 六种qsort排序方法<本文中排序都是采用的从小到大排序>一、对int类型数组排序int num[100];Sample:int cmp ( const void *a , const void *b ){ return *(int *)a - *(int *)b;}qsort(num,100,sizeof(num[0]),cmp);二、对char类型数组排序（同int类型）char word[100];Sample:int cmp( const void *a , const void *b ){ return *(char *)a - *(char *)b;}qsort(w.. 阅读全文
posted @ 2012-12-29 10:28 Jack Ge 阅读(254) 评论(0) 推荐(0)
HDU 1009 FatMouse' Trade
摘要： FatMouse' Tradehttp://acm.hdu.edu.cn/showproblem.php?pid=1009Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 28122 Accepted Submission(s): 9028 Problem DescriptionFatMouse prepared M pounds of cat food, ready to trade with the cats guarding t 阅读全文
posted @ 2012-12-29 10:16 Jack Ge 阅读(239) 评论(0) 推荐(0)
Hrbust 1176 小陈老师、雪人
摘要： 小陈老师、雪人http://acm.hrbust.edu.cn/index.php?m=ProblemSet&a=showProblem&problem_id=1176Time Limit: 1000 MSMemory Limit: 65536 KTotal Submit: 79(22 users)Total Accepted: 32(14 users)Rating:Special Judge: YesDescription东北的冬季，尤其是过年的时候，小陈老师喜欢去堆雪人。 每个雪人主要由三个雪球构成：大雪球、中雪球、小雪球。 他已经准备好了N个雪球，半径分别等于r1, r2 阅读全文
posted @ 2012-12-29 09:29 Jack Ge 阅读(268) 评论(0) 推荐(0)
2012年12月28日
HDU 1022 Train Problem I
摘要： Train Problem Ihttp://acm.hdu.edu.cn/showproblem.php?pid=1022Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 12861 Accepted Submission(s): 4705 Problem DescriptionAs the new term comes, the Ignatius Train Station is very busy nowadays. A lot of s 阅读全文
posted @ 2012-12-28 22:39 Jack Ge 阅读(455) 评论(0) 推荐(0)
HDU 2817 A sequence of numbers
摘要： A sequence of numbershttp://acm.hdu.edu.cn/showproblem.php?pid=2817Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1594 Accepted Submission(s): 494 Problem DescriptionXinlv wrote some sequences on the paper a long time ago, they might be arithmet 阅读全文
posted @ 2012-12-28 21:56 Jack Ge 阅读(417) 评论(0) 推荐(0)
HDU 1943 Ball bearings
摘要： Ball bearingshttp://acm.hdu.edu.cn/showproblem.php?pid=1943Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 43 Accepted Submission(s): 22 Problem DescriptionThe Swedish company SKF makes ball bearings. As explained by Britannica Online, a ball bea 阅读全文
posted @ 2012-12-28 20:40 Jack Ge 阅读(218) 评论(0) 推荐(0)
HDU 4278 Faulty Odometer
摘要： Faulty Odometerhttp://acm.hdu.edu.cn/showproblem.php?pid=4278Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 725 Accepted Submission(s): 512 Problem Description You are given a car odometer which displays the miles traveled as an integer. The od. 阅读全文
posted @ 2012-12-28 11:42 Jack Ge 阅读(224) 评论(0) 推荐(0)