Go: package main

import (
	"fmt"
	"math"
)

func main() {
	var a, b float64
	fmt.Scanf("%v %v", &a, &b)
	fmt.Println(math.Abs(a - b))
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<string> vstr;
typedef pair<ll, ll> pll;
typedef vector<pll> vp;
typedef map<ll, ll> mll;
typedef map<string, ll> mstrll;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fir first
#define sec second
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for(ll i = ll(a); i < ll(b); i++)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep,)(__VA_ARGS__)
#define each(i, n) for(auto&& i: n)
#define out(x) cout << (x)
#define indent() cout << '\n'
#define print(x) cout << (x) << '\n'
#define debug(x) cerr << #x << ": " << (x) << '\n'
ll gcd(ll a, ll b){return b != 0 ? gcd(b, a % b) : a;}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
ll a, b, c, n, m, x, y, z, w, h, ans, cnt, mx, mn;
string s, t;
ll dx[] = {-1, 0, 1, 0}, dy[] = {0, -1, 0, 1};
//vll dx = {-1, 0, 1, -1, 1, -1, 0, 1}, dy = {-1, -1, -1, 0, 0, 1, 1, 1};
string alphabet = "abcdefghijklmnopqrstuvwxyz";

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    while(cin >> n >> m){
        print(abs(n - m));
    }
}

C++: #include <iostream>
using namespace std;
int main(){

int a , b , c ;
cin >> a >> b ;
c = a - b ;
if (c < 0 ) cout << c * -1 <<endl ;
cout << c << endl ;

return 0;
}

C++: #include<iostream>
using namespace std;
 
 
int x1,x2;
 
int main(){
cin>>x1>>x2;

if(x1<x2)cout<< x2-x1 <<endl;
else cout<< x1-x2 <<endl;
 
return 0;
}

C++: #include<iostream>
using namespace std;
int main(){

int x1,x2;
cin>>x1>>x2;
if(x1>x2)cout<<x1-x2<<endl;
else
cout<<x2-x1<<endl;

return 0;
}

C++: #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a,b) for(int i=a;i<=b;i++)
#define rev(i,n) for(int i=(n)-1;i>=0;i--)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define pi pair<int,int>
#define vp vector<par<int,int>>
#define mp make_pair
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define MEMSET(a) memset(a,0,sizeof(a))
#define inf (1ll<<60)
#define Yes(f) cout<<(f?"Yes":"No")<<endl
#define yes(f) cout<<(f?"yes":"no")<<endl
#define YES(f) cout<<(f?"YES":"NO")<<endl
#define SORT(v) sort(all(v))
#define RSORT(v) sort(all(v), greater<int>())

using namespace std;

const int mod=1e9+7;
const string sp=" ";

void run();

void init() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout<<fixed<<setprecision(12);
}

signed main(){
    init();
    run();
    return 0;
}
      
void run(){
    int a,b;
    cin>>a>>b;
    cout<<abs(a-b)<<endl;
}

C++: #include <iostream>
using namespace std;
int main(){

int x1 , x2 ;
cin >> x1 >> x2 ;

if ( x1 < x2 ) cout<< x2 - x1 << endl ;
else
cout << x1 - x2 <<endl ;

return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(void)
{
	int n,m;
	
	cin>>n>>m;
	
	if(n==m) cout<<0<<endl;
	
	else if(n>m) cout<<n-m<<endl;
	
	else cout<<m-n<<endl;
	
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int main()
{
	int m,n;
	cin>>m>>n;
	cout<<abs(m-n)<<endl;
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  int a,b;
  cin>>a>>b;
  if(a>=b){
  cout<<a-b<<endl;
  }
  else{
    cout<<b-a<<endl;
  }

  
}

C++: #include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>

#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <regex>
#define ull unsigned long long
#define REP(i,n) for(int i = 0; i < n; i++)
#define FOR(i,j,n) for(int i = j; i < n; i++)
#define RFOR(i,j,n) for(int i = j-1; i >= n; i--)
#define PREC(n) fixed << setprecision(n)
#define print_array(v) REP(__k, v.size()) { cout << v[__k]; if(__k != v.size()-1) cout << " "; else cout << endl; }
using namespace std;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int x_1, x_2;
	cin >> x_1 >> x_2;
	cout << abs(x_1 - x_2) << endl;
}

C++: #include <iostream>
using namespace std;
 
int main()
{
    int x, y;
 
    cin >> x >> y;
 
    if (x > y)
        cout << x - y << endl;
    else
        cout << y - x << endl;
 
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

int main() {
  int a, b;
  cin >> a >> b;
  cout << abs(a - b) << endl;
}

C++: #include <stdio.h>

int main(void)
{
	int x1,x2;
	scanf("%d %d",&x1,&x2);
	if(x2>x1){
		printf("%d\n",x2-x1);
	}
	else if(x1>x2){
		printf("%d\n",x1-x2);
	}
	else{
		printf("%d\n",x1-x2);
	}
	return 0;
}

C++: #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;

//template
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>(b);i--)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll; typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename A,size_t N,typename T>void Fill(A(&array)[N],const T &val){fill((T*)array, (T*)(array+N), val);}
const int inf = INT_MAX / 2; const ll INF = LLONG_MAX / 2;
//template end



int main(){
    int x[2];
    rep(i,0,2)scanf("%d",&x[i]);
    printf("%d\n",abs(x[0]-x[1]));
    return 0;
}

C++: #include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <vector>
#include <cmath>
#include <cstdlib>

using namespace std;

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define REPO(i, n) for(int i = 1;i <= n;i++)
#define ll long long
#define INF 1999999999
#define MINF -1999999999

int main() {
	int a,b;
	cin >> a >> b;
	cout << max(a,b) - min(a,b) << endl;
}

C++: #include <iostream>
using namespace std;
int main(void){
    // Your code here!
    int x,y;
    cin>>x>>y;
    if(x<=y){cout<<y-x<<endl;}
    else if(x>y){cout<<x-y<<endl;}
}

C++: #include <cstdio>
#include <algorithm>
using namespace std;
int main(){
    int a, b;
    scanf("%d %d", &a, &b);
    if (b > a) swap(a, b);
    printf("%d\n", a-b);
    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
    int a,b;
    cin >> a >> b;
    cout << abs(b-a) << endl;
    return 0;
}

C++: #include <iostream>
using namespace std;
int main(void){
    int a,b;
    cin >> a >> b;
    if(a>b){
        cout << a-b << endl;
    }
    else if(a<b){
        cout << b-a << endl;
    }
    else if(a==b){
        cout << "0" << endl;
    }
}

C++: #include<iostream>
using namespace std;
int main(){
    int A,B;
    cin >> A >> B;
    if(A>B){
        cout << A-B << endl;
    }else if(B>A){
        cout << B-A << endl;
    }else if(A==B){
        cout << 0 <<endl;
    }
    return 0;
}