大数问题
hpugym
这个作者很懒,什么都没留下…
展开
-
hdu 1753 大明A+B
大明A+B Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 8353 Accepted Submission(s): 2946 Problem Description 话说,经过了漫长的一个多月,小明已经成长了许多,原创 2014-08-04 11:17:10 · 504 阅读 · 0 评论 -
hdu 不可摸数
不可摸数 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 8417 Accepted Submission(s): 2176 Problem Description s(n)是正整数n的真因子之和,即小于n且整除n的因子原创 2014-07-31 16:53:47 · 818 阅读 · 0 评论 -
hdu 大菲波数
Problem Description Fibonacci数列,定义如下: f(1)=f(2)=1 f(n)=f(n-1)+f(n-2) n>=3。 计算第n项Fibonacci数值。 Input 输入第一行为一个整数N,接下来N行为整数Pi(1 Output 输出为N行,每行为对应的f(Pi)。 Sample Input 5 1 2 3 4 5原创 2014-07-31 17:59:12 · 342 阅读 · 0 评论 -
hdu 1865
Problem Description You will be given a string which only contains ‘1’; You can merge two adjacent ‘1’ to be ‘2’, or leave the ‘1’ there. Surly, you may get many different results. For example, giv原创 2014-10-12 19:50:02 · 561 阅读 · 0 评论 -
hdu 1250
Problem Description A Fibonacci sequence is calculated by adding the previous two members the sequence, with the first two members being both 1. F(1) = 1, F(2) = 1, F(3) = 1,F(4) = 1, F(n>4) = F(n原创 2014-10-21 16:32:20 · 521 阅读 · 0 评论 -
HDU1134——Game of Connections (大数乘法,除法)+ (卡特兰数列)
Game of Connections Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 14 Accepted Submission(s) : 10 Problem Description This is a small but原创 2015-04-15 21:14:12 · 679 阅读 · 0 评论