高精度 加法

 

題目連結：http://acm.hdu.edu.cn/showproblem.php?pid=1715

題目大意：求斐波拉契數列

 

#include<iostream>#include<cmath>#include<cstdio>#include<cstdlib>#include<string>#include<cstring>#include<algorithm>#include<vector>#include<map>#define eps 1e-6#define INF (1<<20)#define PI acos(-1.0)using namespace std;int save[1005][510];int main(){    save[1][1]=save[2][1]=1;    for(int i=3;i<=1000;i++)    {        for(int j=1;j<500;j++)        {            save[i][j]+=save[i-1][j]+save[i-2][j];            save[i][j+1]=save[i][j]/10;            save[i][j]=save[i][j]%10;        }    }    int t,n;    scanf("%d",&t);    while(t--)    {        scanf("%d",&n);        int i=500;        while(save[n][i]==0)            i--;        while(i>=1)        {            printf("%d",save[n][i]);            i--;        }        putchar('\n');    }    return 0;}