洛谷 P1601 A+B Problem （高精） 题解 C/C++

//P1601 A+B Problem（高精）
//#define LOCAL
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <cctype>
#include <sstream>
#define inf 0x3f3f3f3f
#define eps 1e-6
using namespace std;
#define clr(x) memset(x,0,sizeof((x)))
const int maxn = 100;
#define MAX(a,b,c) ((a)>(b)?((a)>(c)?(a):(c)):((b)>(c)?(b):(c)))
#define _max(a,b) ((a) > (b) ? (a) : (b))
#define _min(a,b) ((a) < (b) ? (a) : (b))
#define _for(a,b,c) for(int a = b;a<c;a++)
char a[100],b[100];
int c[200];
void reverse(int l1,int l2) {
    
    //逆序存储
	char tmp;
	for(int i = 0;i<l1/2;i++) {
    
    
		tmp = a[i];
		a[i] = a[l1-1-i];
		a[l1-1-i] = tmp;
	}
	for(int i = 0;i<l2/2;i++) {
    
    
		tmp = b[i];
		b[i] = b[l2-1-i];
		b[l2-1-i] = tmp;
	}
}
int main()
{
    
    
#ifdef LOCAL 
	freopen("data.in","r",stdin);
	freopen("data.out","w",stdout);
#endif
	scanf("%s%s",a,b);
	int la = strlen(a),lb = strlen(b);
	int i,carry = 0;
	int len  = _max(la,lb);
	reverse(la,lb);//颠倒一下存储,便于模拟
	for(int j = la;j<maxn;j++) {
    
    
		a[j] = '0';
	}
	for(int k = lb;k<maxn;k++) {
    
    
		b[k] = '0';
	}
	for(i = 0;i<maxn;i++) {
    
    
		c[i] = (a[i]-'0')+(b[i]-'0')+carry;
		carry = c[i]/10;
		c[i] %= 10;
	}
	if(c[len]==0)len--;
	for(int j = len;j>=0;j--) {
    
    
		cout<<c[j];
	}
    return 0;
}