Submission #1301389

---

Source Code Expand

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int t(int a,int b,int c) {
	return a * 100 + b * 10 + c;
}
int main() {
	string as, bs; cin >> as >> bs;
	int a[3], b[3];
	for (int i = 0; i < 3; i++) {
		a[i] = as[i] - '0';
		b[i] = bs[i] - '0';
	}
	int ans =      t(9, a[1], a[2]) - t(b[0], b[1], b[2]) ;
	ans = max(ans, t(a[0], 9, a[2]) - t(b[0], b[1], b[2]));
	ans = max(ans, t(a[0], a[1], 9) - t(b[0], b[1], b[2]));	
	ans = max(ans, t(a[0], a[1], a[2]) - t(1, b[1], b[2]));
	ans = max(ans, t(a[0], a[1], a[2]) - t(b[0], 0, b[2]));
	ans = max(ans, t(a[0], a[1], a[2]) - t(b[0], b[1], 0));
	cout << ans << endl;
}

Submission Info

Judge Result