85分求调

#include <bits/stdc++.h>
#define ll long long
#define endl "\n"
using namespace std;
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    string s1, s2;
    cin >> s1 >> s2;
    if (s1 < s2){
        string s3 = s2;
        s2 = s1;
        s1 = s3;
        cout << "-";
    }
    if (s1 == s2){
        cout << "0";
        return 0;
    }
    reverse(s1.begin(), s1.end());
    reverse(s2.begin(), s2.end());
    int a[10086], b[10086], c[100086];
    for (int i = 0;i < s1.size();i++){
        a[i] = s1[i] - '0';
    }
    for (int i = 0;i < s2.size();i++){
        b[i] = s2[i] - '0';
    }
    for (int i = 0;i < s1.size();i++){
        c[i] = 0;
    }
    for (int i = 0;i < s1.size();i++){
        c[i] += a[i] - b[i];
        if (c[i] < 0){
            c[i + 1]--;
            c[i] = c[i] + 10;
        }
    }
    int len = s1.size() - 1;
    while (c[len] == 0){
        len--;
    }
    for (int i = len;i >= 0;i--){
        cout << c[i];
    }
    return 0;
}