hdu 1250
2014-08-02 18:30
141 查看
#include<stdio.h> int a[10100][505]={0}; int main() { int i,j,n; a[1][1]=a[2][1]=a[3][1]=a[4][1]=1; for(i=5;i<=10000;i++) { for(j=1;j<=500;j++) { a[i][j]+=a[i-1][j]+a[i-2][j]+a[i-3][j]+a[i-4][j]; a[i][j+1]+=a[i][j]/100000; a[i][j]=a[i][j]%100000; } } while(scanf("%d",&n)!=EOF) { for(j=500;j>=1;j--) if(a [j]!=0) { printf("%d",a [j]);break; } for(i=j-1;i>=1;i--) printf("%05d",a [i]); printf("\n"); } return 0; }
相关文章推荐
- hdu 1250 大树
- HDU1250(大数相加)
- hdu 1250 Hat's Fibonacci
- hdu1250 Hat's Fibonacci
- hdu 1250 Hat's Fibonacci(高精度加法)
- HDU 1250(大数相加)
- hdu 1250
- hdu 1250
- hdu 1250(大整数)
- hdu 1250
- HDU 1250 高精度
- HDOJ/HDU 1250 Hat's Fibonacci(大数~斐波拉契)
- hdu 1250 Hat's Fibonacci
- HDU 1250 Hat's Fibonacci(大数相加)
- [大数] HDU 1250 - Hat's Fibonacci
- Hdu 1250 Hat's Fibonacci
- HDU 1250 Hat's Fibonacci
- hdu 1130, 1133, 1250
- HDU 1250 Hat's Fibonacci 大数加法 进位10000000
- HDU 1250(JAVA版)