寒假集训3 a 斐波拉契 大数相加

题目链接

解析：主要还是简单大数相加

#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
#define ll long long
#define MAX 205
int f[MAX][MAX];
//char f[MAX][MAX];
char s[MAX];


int main()
{
//   freopen("E:input.txt","r",stdin);
    int i,n,j;
    memset(f,sizeof(f));
    f[1][0] = 1;
    f[2][0] = 2;

    for (i = 3; i < MAX; i++)
    {
       for (j = 0; j < MAX; j++)
       {
           /*if (f[i - 1][j] == 0 && f[i - 2][j] == 0)
           {
               break;
           }*/
           f[i][j] += f[i - 1][j] + f[i - 2][j];
           if (f[i][j] > 9)
           {
               f[i][j] -= 10;
               f[i][j + 1]++;
           }
       }
       //printf("%d: %I64dn",i,f[i]);
    }
    scanf("%d",&n);
    getchar();
    while (n--)
    {
        scanf("%s",s);
        int len = strlen(s);
        for (i = MAX - 1; i >= 0; i--)
        {
            if (f[len][i] != 0)
            {
                j = i;
                break;
            }
        }
        for (i = j; i >= 0; i--)
        {
            printf("%d",f[len][i]);
        }
        printf("n");
    }
    return 0;
}