随笔分类 -  ACM

产生数
摘要：Description给出一个整数 n（n<10^30) 和 k 个变换规则（k<=15）。规则：一位数可变换成另一个一位数：规则的右部不能为零。例如：n=234。有规则（k＝2）：2－> 53－> 6上面的整数 234 经过变换后可能产生出的整数为（包括原数）:234534264564共 4 种不同的产生数问题：给出一个整数 n 和 k 个规则。求出：经过任意次的变换（0次或多次），能产生出多少个不同整数。仅要求输出个数。Input键盘输人，格式为： n k x1 y1 x2 y2 ... ... xn ynOutput 屏幕输出，格式为：一个整数（满足条件的个数）： 阅读全文
posted @ 2011-09-02 09:47 贺佐安 阅读(465) 评论(0) 推荐(2) 编辑
HDU 1164 Eddy's research I
摘要：Eddy's research ITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2486 Accepted Submission(s): 1527Problem DescriptionEddy's interest is very extensive, recently he is interested in prime number. Eddy discover the all number owned can be di 阅读全文
posted @ 2011-08-09 15:05 贺佐安 阅读(702) 评论(0) 推荐(0) 编辑
HDU 1163 Eddy's digital Roots
摘要：Eddy's digital RootsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1643 Accepted Submission(s): 968Problem DescriptionThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single dig 阅读全文
posted @ 2011-08-09 14:51 贺佐安 阅读(210) 评论(0) 推荐(0) 编辑
HDU 1098 Ignatius's puzzle
摘要：Ignatius's puzzleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2737 Accepted Submission(s): 1805Problem DescriptionIgnatius is poor at math,he falls across a puzzle problem,so he has no choice but to appeal to Eddy. this problem describes th 阅读全文
posted @ 2011-08-05 18:27 贺佐安 阅读(281) 评论(0) 推荐(0) 编辑
HDU 1097 A hard puzzle
摘要：A hard puzzleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13563 Accepted Submission(s): 4724Problem Descriptionlcy gives a hard puzzle to feng5166,lwg,JGShining and Ignatius: gave a and b,how to know the a^b.everybody objects to this BT problem 阅读全文
posted @ 2011-08-05 17:45 贺佐安 阅读(138) 评论(0) 推荐(0) 编辑
HDU 1070 Milk
摘要：MilkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5780 Accepted Submission(s): 1320Problem DescriptionIgnatius drinks milk everyday, now he is in the supermarket and he wants to choose a bottle of milk. There are many kinds of milk in the superm 阅读全文
posted @ 2011-08-05 16:56 贺佐安 阅读(559) 评论(0) 推荐(0) 编辑
HDU 1061 Rightmost Digit
摘要：Rightmost DigitTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12407 Accepted Submission(s): 4799Problem DescriptionGiven a positive integer N, you should output the most right digit of N^N.InputThe input contains several test cases. The first lin 阅读全文
posted @ 2011-08-04 17:16 贺佐安 阅读(647) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示