1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
'''
高精度加法
'''

#include <iostream>
#include <vector>
using namespace std;

vector<int> add(vector<int> A, vector<int> B)
{
    if (A.size() < B.size()) return add(B, A);

    vector<int> C;
    int t = 0;
    for (int i = 0; i < A.size(); i ++ )
    {
        t += A[i];
        if (i < B.size()) t += B[i];
        C.push_back(t % 10);
        t /= 10;
    }

    if (t) C.push_back(t);
    return C;
}


int main(){
    string a , b;
    vector<int>A,B;
    cin>>a>>b;
    for(int i =a.size()-1;i>=0;i--){
        A.push_back(a[i]-'0');
    }
    for(int i =b.size()-1;i>=0;i--){
        B.push_back(b[i]-'0');
    }
    auto C=add(A,B);
    for(int i =C.size()-1;i>=0;i--)printf("%d",C[i]);
    
    
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
'''
高精度减法
'''
#include <iostream>
#include <vector>
using namespace std;

//A>=B ?
bool cmp(string a,string b){
    if(a.size()!=b.size())return a.size()>b.size();
    else{
        for(int i=0;i<a.size();i++){
            if(a[i]!=b[i]){
                return a[i]>b[i];
            }
        }
    }
    return true;
}
vector <int> sub(vector<int> &A,vector<int> &B){
    int t=0;
    vector <int>C;
    for(int i=0;i<A.size();i++){
        t=A[i]-t;
        if(i<B.size())t=t-B[i];
        C.push_back((t+10)%10);
        if(t<0)t=1;
        else t=0;
    }
    while(C.size()!=1 && C.back()==0)C.pop_back();
    return C;
}
int main(){
    string a,b;
    cin>>a>>b;
    vector <int>A,B;
    for(int i=a.size()-1;i>=0;i--)A.push_back(a[i]-'0');
    for(int i=b.size()-1;i>=0;i--)B.push_back(b[i]-'0');
    if(cmp(a,b)){
        auto C=sub(A,B);
        for(int i=C.size()-1;i>=0;i--)cout<<C[i];
    }
    else{
        auto C=sub(B,A);
        printf("-");
        for(int i=C.size()-1;i>=0;i--)cout<<C[i];
    }
    
    
}