hdu1715

http://acm.hdu.edu.cn/showproblem.php?pid=1715

模板大数：

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <assert.h>
#include <ctype.h>
#include <map>
#include <string>
#include <set>
#include <bitset>
#include <utility>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <iostream>
#include <fstream>
#include <list>
using  namespace  std;

const  int MAXL = 500;
struct  BigNum
{
    int  num[MAXL];
    int  len;
    BigNum()
    {
        memset(num,0,sizeof(num));
    }
};

//高精度加法
BigNum  Add(BigNum &a, BigNum &b)
{
    BigNum c;
    int  i, len;
    len = (a.len > b.len) ? a.len : b.len;
    memset(c.num, 0, sizeof(c.num));
    for(i = 0; i < len; i++)
    {
        c.num[i] += (a.num[i]+b.num[i]);
        if(c.num[i] >= 10)
        {
            c.num[i+1]++;
            c.num[i] -= 10;
        }
    }
    if(c.num[len])
        len++;
    c.len = len;
    return  c;
}
void  print(BigNum &a)   //输出大数
{
    int  i;
    for(i = a.len-1; i >= 0; i--)
        printf("%d", a.num[i]);
    puts("");
}
//将字符串转为大数存在BigNum结构体里面
BigNum ToNum(char *s)
{
    int i, j;
    BigNum  a;
    a.len = strlen(s);
    for(i = 0, j = a.len-1; s[i] != ''; i++, j--)
        a.num[i] = s[j]-'0';
    return  a;
}

void Init(BigNum &a, char *s, int &tag)   //将字符串转化为大数
{
    int  i = 0, j = strlen(s);
    if(s[0] == '-')
    {
        j--;
        i++;
        tag *= -1;
    }
    a.len = j;
    for(; s[i] != ''; i++, j--)
        a.num[j-1] = s[i]-'0';
}
BigNum p[1005];
void deal()
{
    int tag=1;
    Init(p[1],"1",tag);
    Init(p[2],"1",tag);
    for(int i=3;i<=1000;i++)
    {
        p[i]=Add(p[i-1],p[i-2]);
    }
}
int main(void)
{
    //freopen("in.txt","r",stdin);
    deal();
    int n;
    scanf("%d",&n);
    while(n--)
    {
        int t;
        scanf("%d",&t);
        print(p[t]);
    }
    return 0;
}