Submission #1306993

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1000000000 + 7;
#define REP(i,n) for(int i=0;i<(int)n;++i)

int main(){
    string s, t, ss, tt;
    cin >> s >> t;
    ss = s;
    tt = t;
    int res = -INT_MAX/3;
    for(int i=0;i<3;i++){
        if(s[i]!='9'){
            s[i] = '9';
            break;
        }
    }
    if(t[0]!='0' && t[0]!='1'){
        t[0]='1';
    }else{
        if(t[1]=='0'){
            if(t[2]=='0'){
                1;
            }else{
                t[2]='0';
            }
        }else{
            t[1]='0';
        }
    }

    cout << max(stoi(s) - stoi(tt), stoi(ss)-stoi(t)) << endl;

    return 0;
}

Submission Info

Judge Result