学步园

高精度类，C++模板

hdu1002 A
+ B Problem II

高精度加法

hdu1250 Hat's Fibonacci 

F(1) = 1, F(2) = 1, F(3) = 1,F(4) = 1, F(n>4) = F(n -
1) + F(n-2) + F(n-3) + F(n-4)

高精度加法 Java代码

hdu1212 Big Number

高精度取模

hdu1023 Train Problem II

C[0] = 1

C[n] = C[n-1]*(4*n - 2)*(n+1)

Catalan数：点击打开链接

hdu1134 Game of Connections

Catalan数：C++代码（大数类模板）

hdu1042 N!  

求一个实数的n次方等于多少。

用C写过于繁琐，用Java写easy!：http://blog.csdn.net/yew1eb/article/details/8797947

hdu1133 Buy the Ticket

hdu1316 How Many Fibs?
输出区间(0,10^100)内有多少个斐波拉契数

hdu18651sting
找出递推公式为fibnacci数

POJ 1047Round and Round We Go
POJ 1131Octal Fractions
POJ 1220NUMBER BASE CONVERSION
POJ 1405Heritage
POJ 1503Integer Inquiry http://blog.csdn.net/yew1eb/article/details/8972120
POJ 2385Apple Catching
POJ 2393Yogurt factory
POJ 2394Checking an Alibi
POJ 2395Out of Hay
POJ 2418Hardwood Species
POJ 2419Forests
POJ2389
POJ 1205
POJ 1604
POJ 1894
POJ 2084
POJ 2305
POJ 2325
POJ 2389
POJ 3101
POJ 3199
Ural1013
Ural1104