P1601 A+B Problem（高精）

高精度加法模板

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
using namespace std;
int main()
{
    int a[505], b[505], len;
    memset(a,0,sizeof(a));
    memset(b,0,sizeof(b));
    string s1, s2;
    cin>>s1>>s2;
    a[0] = s1.length();
    for(int i = 1; i <= a[0]; i++) a[i] = s1[a[0]-i]-'0';
    b[0] = s2.length();
    for(int i = 1; i <= b[0]; i++) b[i] = s2[b[0]-i]-'0';
    len = (a[0] > b[0] ? a[0] : b[0]);
    for(int i = 1; i <= len; i++){
        a[i] += b[i];
        a[i+1] += a[i]/10;
        a[i] %= 10;
    }
    len++;
    while(a[len] == 0 && len > 1) len--;
    for(int i = len; i >= 1; i--){
        printf("%d",a[i]);
    }
    printf("\n");
    return 0;
}