Submission #1609526

---

Source Code Expand

#include<functional>
#include<algorithm>
#include<iostream>
#include<utility>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#include<queue>
#include<deque>
#include<map>
#include<set>
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,x,n) for(int i=x;i<n;i++)
#define pb push_back
#define int long long
using namespace std;
const int INF=1000000007;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};

signed main(){
  int a,b;
  cin>>a>>b;
  int tmp=a-b;
  int ans=max(tmp,(a%100+900)-b);
  ans=max(ans,(a-(a%100-a%10)+90)-b);
  ans=max(ans,(a-a%10+9)-b);
  ans=max(ans,a-(b-b/100*100+100));
  ans=max(ans,a-(b-b%100+b%10));
  ans=max(ans,a-(b-b%10));
  cout<<ans<<endl;
  return 0;

}

Submission Info

Judge Result