Submission #1417869

---

Source Code Expand

#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
ll gcd(ll a,ll b) {
	long long g;
	long long c = max(a, b);
	long long d = min(a, b);
	while (true) {
		if (c % d == 0) {
			g = d;
			goto C;
		}
		else {
			c -= d;
			if (c <= d) {
				swap(c, d);
			}
		}
	}
C:
	return g;
}
int main() {
	ll a, b, c, d; cin >> a >> b >> c >> d;
	ll x = abs(c - a), y = abs(b - d);
	ll e = gcd(x, y);
	x /= e; y /= e;
	cout << e*(x + y - 1) << endl;
}

Submission Info

Judge Result