高精度加法

#include<bits/stdc++.h>

using namespace std;

const int N = 1e5+5;

char a[N],b[N];

struct bign{
    int d[N];
    int len;
    bign(){
        memset(d,0,sizeof(d));
        len = 0;
    }
};

bign change(char *t){
    bign c;
    int len = strlen(t);
    c.len = len;
    for(int i=0; i<len; i++){
        c.d[i] = t[len - i - 1] - '0';
    }
    return c;
}

bign add(bign a, bign b){
    bign c;
    int carry = 0;
    for(int i=0; i<a.len || i<b.len; i++){
        int t = a.d[i] + b.d[i] + carry;
        c.d[c.len++] = t % 10;
        carry = t / 10; 
    }
    if(carry != 0) c.d[c.len++] = carry;
    return c;
}

void print(bign c){
    for(int i=c.len - 1; i>=0; i--){
        printf("%d",c.d[i]);
    }
}

int main(){
    scanf("%s%s",a,b);
    bign v1 = change(a);
    bign v2 = change(b);
    print(add(v1,v2));
    return 0;
}