51nod 1005 大数加法

传送门：https://www.51nod.com/onlineJudge/questionCode.html#!problemId=1005

给出2个大整数A,B，计算A+B的结果。

不是简单的大数加法，题目中说A，B可能是负数，因此从是大数加法和大数减法。

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
string A,B;
int ans[10010];
void solve1()
{
    int len1=A.length(),len2=B.length();
    reverse(A.begin()+1,A.end());
    reverse(B.begin()+1,B.end());
    if(len1<len2)
    {
        swap(A,B);
        swap(len1,len2);
    }
    for(int i=1;i<=len1-len2;i++)
        B+="0";
    int ci=0,si=0;
    memset(ans,0,sizeof ans);
    for(int i=1;i<len1;i++)
    {
        int tmp1=A[i]-'0',tmp2=B[i]-'0';
        int tmp3=tmp1+tmp2;
        ans[i]+=ci+tmp3;
        ci=ans[i]/10;
        ans[i]=ans[i]%10;
    }
    ans[len1]=ci;
    cout<<"-";
    for(int i=len1;i>=1;i--)
    {
        if(i==len1&&ans[i]==0) continue;
        printf("%d",ans[i]);
    }
    cout<<endl;
}
void solve2()
{
    bool AN=false,BN=false;
    bool isN=false;
    if(A[0]=='-')
    {
        B="-"+B;
        AN=true;
    }
    else
    {
        A="-"+A;
        BN=true;
    }
    int len1=A.length(),len2=B.length();
    if(len1<len2)
    {
        if(BN) isN=true;
        swap(len1,len2);
        swap(A,B);
    }
    else if(len1==len2)
    {
        bool flag=false;
        for(int i=0;i<len1;i++)
        {
            if(A[i]<B[i])
            {
                //cout<<A[i]<<" "<<B[i]<<endl;
                flag=true;
                if(BN) isN=true;
                break;
            }
            else if(A[i]>B[i])
                break;
        }
        if(flag) swap(A,B);
        else if(AN) isN=true;
    }
    else
    {
        if(AN) isN=true;
    }
    reverse(A.begin()+1,A.end());
    reverse(B.begin()+1,B.end());
    for(int i=1;i<=len1-len2;i++)
        B=B+"0";
    //cout<<A<<endl;
    //cout<<B<<endl;
    memset(ans,0,sizeof ans);
    int ci=0;
    for(int i=1;i<len1;i++)
    {
        int tmp1=A[i]-'0',tmp2=B[i]-'0';
        tmp1=tmp1-ci;
        if(tmp1<tmp2)
        {
            ci=1;
        }
        else ci=0;
        ans[i]=ci*10+tmp1-tmp2;
    }
    int num=0;bool start=false;
    bool zero=true;
    for(int i=len1-1;i>=1;i--)
    {
        if(ans[i]!=0)
        {
            zero=false;
            break;
        }
    }
    if(!zero)
    {
        if(isN) cout<<"-";
    }
    for(int i=len1-1;i>=1;i--)
    {
        if(ans[i]!=0)
        {
            start=true;
            printf("%d",ans[i]);
        }
        else if(start)
            printf("%d",ans[i]);
    }
    if(!start) printf("0");
    cout<<endl;
}
void solve3()
{
    int len1=A.length(),len2=B.length();
    reverse(A.begin(),A.end());
    reverse(B.begin(),B.end());
    if(len1<len2)
    {
        swap(A,B);
        swap(len1,len2);
    }
    for(int i=1;i<=len1-len2;i++)
        B+="0";
    int ci=0,si=0;
    memset(ans,0,sizeof ans);
    for(int i=0;i<len1;i++)
    {
        int tmp1=A[i]-'0',tmp2=B[i]-'0';
        int tmp3=tmp1+tmp2;
        ans[i]+=ci+tmp3;
        ci=ans[i]/10;
        ans[i]=ans[i]%10;
    }
    ans[len1]=ci;
    for(int i=len1;i>=0;i--)
    {
        if(i==len1&&ans[i]==0) continue;
        printf("%d",ans[i]);
    }
    cout<<endl;
}
int main()
{
    getline(cin,A);
    getline(cin,B);
    if(A[0]=='-'&&B[0]=='-')
        solve1();
    else if(A[0]=='-'||B[0]=='-')
    {
        solve2();
    }
    else solve3();
    return 0;
}