高精度
文章平均质量分 58
键盘上的舞者
这个作者很懒,什么都没留下…
展开
-
HDU1316:How Many Fibs?
Problem DescriptionRecall the definition of the Fibonacci numbers: f1 := 1 f2 := 2 fn := fn-1 + fn-2 (n >= 3) Given two numbers a and b, calculate how many Fibonacci numbers are in the ran原创 2013-03-17 21:45:35 · 2171 阅读 · 0 评论 -
HDU4927:Series 1(JAVA大数)
Problem DescriptionLet A be an integral series {A1, A2, . . . , An}.The zero-order series of A is A itself.The first-order series of A is {B1, B2, . . . , Bn-1},where Bi = Ai+1 - Ai.Th原创 2014-08-08 13:54:10 · 1437 阅读 · 0 评论 -
HDU4608:I-number
Problem DescriptionThe I-number of x is defined to be an integer y, which satisfied the the conditions below:1. y>x;2. the sum of each digit of y(under base 10) is the multiple of 10;3. among原创 2013-10-21 21:54:50 · 1691 阅读 · 0 评论 -
HDU1250:Hat's Fibonacci
Problem DescriptionA 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 -原创 2013-07-22 14:27:01 · 2419 阅读 · 0 评论 -
POJ2389:Bull Math
DescriptionBulls are so much better at math than the cows. They can multiply huge integers together and get perfectly precise answers ... or so they say. Farmer John wonders if their answers are cor原创 2013-03-19 16:10:32 · 1739 阅读 · 0 评论 -
HDU1715:大菲波数
Problem DescriptionFibonacci数列,定义如下:f(1)=f(2)=1f(n)=f(n-1)+f(n-2) n>=3。计算第n项Fibonacci数值。 Input输入第一行为一个整数N,接下来N行为整数Pi(1 Output输出为N行,每行为对应的f(Pi)。 Sample Input51原创 2013-03-17 21:51:39 · 1599 阅读 · 0 评论 -
HDU1212:Big Number
Problem DescriptionAs we know, Big Number is always troublesome. But it's really important in our ACM. And today, your task is to write a program to calculate A mod B.To make the problem easier,原创 2013-04-16 21:31:12 · 2660 阅读 · 1 评论 -
HDU1047:Integer Inquiry
Problem DescriptionOne of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various sums of those numb原创 2013-03-03 13:36:12 · 3609 阅读 · 0 评论 -
POJ3982:序列
Description数列A满足An = An-1 + An-2 + An-3, n >= 3 编写程序,给定A0, A1 和 A2, 计算A99Input输入包含多行数据 每行数据包含3个整数A0, A1, A2 (0 数据以EOF结束Output对于输入的每一行输出A99的值Sample Input1 1 1Sample Output69原创 2013-03-19 16:32:35 · 1750 阅读 · 0 评论 -
CSU1576: Catalan Square
DescriptionInput Output Sample Input0Sample Output1HINTSourceNCPC 2014题目我没看,直接看公式和输出要求就开始做了,意思就是求公式。。明显大数,原创 2015-04-26 17:36:14 · 1377 阅读 · 0 评论