Submission #1606381

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#define lol(i,n) for(int i=0;i<n;i++)
int mod=1000000007;
typedef long long ll;
using namespace std;
string a,b;
int sum(){
	int ret;
	ret=100*(a[0]-b[0]);
	ret+=10*(a[1]-b[1]);
	ret+=(a[2]-b[2]);
	return ret;
}
int main(){
	cin>>a>>b;
	int cnt=sum();
	int ans=-mod;
	ans=max(ans,cnt+('9'-a[0])*100);
	ans=max(ans,cnt+(b[0]-'1')*100);
	ans=max(ans,cnt+('9'-a[1])*10);
	ans=max(ans,cnt+(b[1]-'0')*10);
	ans=max(ans,cnt+('9'-a[2])*1);
	ans=max(ans,cnt+(b[2]-'0')*1);
	cout<<ans<<endl;
	return 0;
}

Submission Info

Judge Result