高精度加法模板

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int additive(int a[], int len1, int b[], int len2, int c[]) // 加法
{
    int ans = 0, i = 0;
    while(i <= len1-1 || i <= len2-1)
    {
        c[i] = (a[i]+b[i]+ans)%10;
        ans = (a[i]+b[i]+ans)/10;
        i++;
    }
    if(ans)
    {
        c[i] = ans;
        return i;
    }
    else
    return i-1;
}
int main()
{
    char a[505], b[505];
    int c[505], d[505], e[505];
    memset(c, 0, sizeof(c));
    memset(d, 0, sizeof(d));
    memset(e, 0, sizeof(e));
    scanf("%s%s", a, b);
    int len1 = strlen(a), len2 = strlen(b), len3;
    for(int i = 0; i < len1; i++)
    {
        c[len1-i-1] = a[i] - '0';
    }
    for(int i = 0; i < len2; i++)
    {
        d[len2-i-1] = b[i] - '0';
    }
    len3 = additive(c, len1, d, len2, e);
    for(int i = len3; i >= 0; i--)
        printf("%d" , e[i]);
        printf("\n");

}

//code(vs)3116

新的大数模板来了，黑科技，用string，不用判断有多少位，下面附上代码：

//HDU1250

#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
string add(string a, string b)
{
    string s;
    reverse(a.begin(), a.end());
    reverse(b.begin(), b.end());
    int i = 0;
    int m, k = 0;
    while(a[i] && b[i])
    {
        m = a[i]-'0'+b[i]-'0'+k;
        k = m/10;
        s+=(m%10+'0');
        i++;
    }
    if(i == a.size())
    {
        while(i!=b.size())
        {
            m = k+b[i]-'0';
            k = m/10;
            s += m%10+'0';
            i++;
        }
        if(k) s += k+'0';
    }
    else if(i == b.size())
    {
        while(i != a.size())
        {
            m = k+a[i]-'0';
            k = m/10;
            s+=m%10+'0';
            i++;
        }
        if(k) s += k+'0';
    }
    reverse(s.begin(), s.end());
    return s;
}
string ch[7510];
int main()
{
    ch[1] = ch[2] = ch[3] = ch[4] ='1';
    for(int i = 5; i < 7500; i++)
    {
        ch[i] = add(add(ch[i-1], ch[i-2]), add(ch[i-3], ch[i-4]));
    }
    int n;
    while(~scanf("%d", &n))
    {
        cout<<ch[n];
        cout<<endl;
    }
}