51nod 大数加法

略坑，wa了几次。基础题，硬生生被我写的好长。继续加油。

给出2个大整数A,B，计算A+B的结果。
Input
第1行：大数A
第2行：大数B
(A,B的长度 <= 10000 需注意：A B有可能为负数）
Output
输出A + B
Input示例
68932147586
468711654886
Output示例
537643802472

#include<iostream>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cctype>
#include<cmath>
#include<ctime>
#include<string>
#include<stack>
#include<deque>
#include<queue>
#include<list>
#include<set>
#include<map>
#include<cstdio>
#include<limits.h>
#define MOD 1000000007
#define fir first
#define sec second
#define fin freopen("/home/ostreambaba/文档/input.txt", "r", stdin)
#define fout freopen("/home/ostreambaba/文档/output.txt", "w", stdout)
#define mes(x, m) memset(x, m, sizeof(x))
#define Pii pair<int, int>
#define Pll pair<ll, ll>
#define INF 1e9+7
#define Pi 4.0*atan(1.0)
#define lowbit(x) (x&-x)
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
typedef long long ll;
typedef unsigned long long ull;
const double eps = 1e-7;
const int MAX = 101;
using namespace std;
#define time
int bigorsmall(int *a, int *b, int len){  //判断大小
    for(int i = len - 1; i >= 0; --i){
        if(a[i] > b[i])
            return 1;
        if(a[i] < b[i]){
            return 2;
        }
    }
    return 0;
}
int main()
{
   // fin;
    //fout;
    string str1, str2;
    cin >> str1 >> str2;
    int num1[10002];
    int num2[10002];
    mes(num1, 0);
    mes(num2, 0);
    int len1 = str1.size();
    int len2 = str2.size();
    int flag1 = 1;
    int flag2 = 1;
    int flag3 = 0;
    int mlen = max(len1, len2);
    if('0' == str1[0]&&'0' == str2[0]){
        cout << "0" << endl;
        return 0;
    }
    else{
        if(str1[0] == '-'){
            flag1 = 0;
        }
        if(str2[0] == '-'){
            flag2 = 0;
        }
    }
    if((!flag1 && !flag2) || (flag1 && flag2)){  //判断正负符号
        if(!flag1 && !flag2 ){
            flag3 = 1;
            str1 = str1.substr(1, len1);
            str2 = str2.substr(1, len2);
            len1 -= 1;
            len2 -= 1;
        }
        for(int i = len1 - 1, j = 0; i >= 0; --i, ++j){
            num1[j] = str1[i] - '0';
        }
        for(int i = len2 - 1, j = 0; i >= 0; --i, ++j){
            num2[j] = str2[i] - '0';
        }
        for(int i = 0; i <= mlen; ++i){
            num1[i] += num2[i];
            num1[i+1] += num1[i]/10;
            num1[i] = num1[i]%10;
        }
       /* int k = 10001;
        while(!num1[--k]);
        for(; k >= 0; --k){
            cout << num1[k];
        }
        cout << endl;
        return 0;*/
    }
    else{
        if((!flag1 && flag2) || (flag1 && !flag2)){
            if(flag1 && !flag2){
                string tmp = str1;  //交换字符串
                str1 = str2;
                str2 = tmp;
                len1 ^= len2;
                len2 ^= len1;
                len1 ^= len2;
            }
            str1 = str1.substr(1, len1);  //去负号
            len1 -= 1;
            mlen= max(len1, len2);
            cout << str1 << endl << str2 << endl;
            for(int i = len1 - 1, j = 0; i >= 0; --i, ++j){
                num1[j] = str1[i] - '0';
            }
            for(int i = len2 - 1, j = 0; i >= 0; --i, ++j){
                num2[j] = str2[i] - '0';
            }
            if(len1 > len2 || (len1 == len2&&(bigorsmall(num1, num2, len1) == 1))){
                flag3 = 1;
                for(int i = 0; i <= mlen; ++i){
                    if(num1[i] < num2[i]){
                        num1[i+1] -= 1;
                        num1[i] += 10;
                    }
                    num1[i] -= num2[i];
                }
            }
            else if(len1 == len2 && bigorsmall(num1, num2, len1) == 0){
                    cout << "0" << endl;
                    return 0;
            }
            else if(len1 < len2 || (len1 == len2&&(bigorsmall(num1, num2, len1) == 2))){
                for(int i = 0; i < mlen; ++i){
                    if(num2[i] < num1[i]){
                        num2[i+1] -= 1;
                        num2[i] += 10;
                    }
                    num2[i] -= num1[i];
                }
                for(int i = 0; i < mlen; ++i){
                    num1[i] = num2[i];
                }
            }
        }
    }
    if(flag3 == 1){
        cout << "-";
    }
    int k = 10001;
    while(!num1[--k]);  //输出
    for(; k >= 0; --k){
        cout << num1[k];
    }
    cout << endl;
    return 0;
}