Submission #1473778

---

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>
#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 pf push_front
#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 c=0;
  if(a==(-1)*b){
    c++;
    cout<<c<<endl;
    return 0;
  }
  if(a<0&&b<0&&b<a){
    c+=2+abs(a-b);
    cout<<c<<endl;
  }else if(a<0&&b<0&&a<b){
    cout<<abs(a-b)<<endl;
  }else if(a<b&&0<a){
    cout<<b-a<<endl;
  }else if(a<0&&0<b){
    c+=1+abs(a-b);
    cout<<c<<endl;
  }

  return 0;
}

Submission Info

Judge Result