高精度加减乘

//
//  main.cpp
//  洛谷
//  高精度
//
//  Created by dyg on 2019/7/15.
//  Copyright © 2019 dyg. All rights reserved.
//

#include <iostream>
#include <algorithm>
#include <string>
using namespace std;

int alength=0,blength=0,x[10000],y[10000],result[10000000]={0},cb=0,i=1,f=1;

string addOperation(string a , string b){           //高精度加法
    string r;
    while (i<=alength&&i<=blength) {
        int t = (a[alength-i]-'0')+(b[blength-i]-'0')+cb;
        cb=0;
        if(t>9){
            cb=t/10;
            t%=10;
        }
        r.push_back(t+'0');
        i++;
    }
    while (i<=alength) {
        int t = (a[alength-i]-'0')+cb;
        cb=0;
        if(t>9){
            cb=t/10;
            t%=10;
        }
        r.push_back(t+'0');
        i++;
    }
    while (i<=blength) {
        int t = (b[blength-i]-'0')+cb;
        cb=0;
        if(t>9){
            cb=t/10;
            t%=10;
        }
        r.push_back(t+'0');
        i++;
    }
    if(cb>0)r.push_back(cb+'0');
    reverse(r.begin(), r.end());
    return r;
}

string minusOperation(string a , string b){         //高精度减法，先按照加负数处理成加法（不存在进位），再解决每一位
    string r;
    for (;i<=alength&&i<=blength;i++)
        r.push_back((a[alength-i]-b[blength-i])+'0');
    if(i<= blength||(alength==blength&&b[0]>a[0]))f=0;
    else f=1;
    for(;i<=alength;i++)
        r.push_back(a[alength-i]);
    for(;i<=blength;i++)
        r.push_back(96-b[blength-i]);
    if(f==0)
        for(int j=0;j<r.size();j++)
            r[j]=96-r[j];
    
    for(int j=0;j<r.size();j++)
        if(r[j]<'0'){
            r[j]+=10;
            r[j+1]--;
        }
    reverse(r.begin(), r.end());
    string result;
    if(f==0)result.push_back('-');
    int k=0;
    for(;k<r.size()&&r[k]=='0';k++);
    for(;k<r.size();k++)
    result.push_back(r[k]);
    if(result.size()==0)result.push_back('0');
    return result;
}

string multiplication(string a , string b){             //高精度乘法
    string r;
    for(int i=0;i<alength;i++)
        x[alength-i]=(int)a[i]-48;
    for (int i=0; i<blength; i++)
        y[blength-i]=(int)b[i]-48;
    for(int i=1;i<=alength;i++){
        cb=0;
        for(int j=1;j<=blength;j++){
            result[i+j-1]+= cb+x[i]*y[j];
            cb= result[i+j-1]/10;
            result[i+j-1]%=10;
        }
        result[i+blength]=cb;
    }

    int k=alength+blength;
    for(;result[k]==0;k--);
    for(;k>=1;k--)r.push_back(result[k]+48);
    return r;
}


int main() {
    
    string a,b;
    cin>>a>>b;
    alength = (int)a.size();
    blength = (int)b.size();
    cout<<"a+b="<<addOperation(a, b)<<endl;;
    cout<<"a-b="<<minusOperation(a, b)<<endl;;
    cout<<"a*b="<<multiplication(a, b)<<endl;
    return 0;
}