Submission #2516567

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
#include <cmath>
#include <iomanip>
#include <queue>
#include <map>
#include <set>
#include <random>
#include <sstream>
#include <stack>
#include <deque>

using namespace std;

#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vl;

int A, B;
int ans = -999999999;

int main() {
    cin >> A >> B;
    ans = max(ans, 900 + A % 100 - B);
    ans = max(ans, A / 100 * 100 + 90 + A % 10 - B);
    ans = max(ans, A / 10 * 10 + 9 - B);
    ans = max(ans, A - (100 + B % 100));
    ans = max(ans, A - (B / 100 * 100 + B % 10));
    ans = max(ans, A - (B / 10 * 10));
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result