Submission #3594833

---

Source Code Expand

#include <iostream>
#include <cmath>
using namespace std;

long long N, X, A[100009], L;

long long gcd(long long a, long long b) {
	if (b == 0) return a;
	return gcd(b, a%b);
}

int main() {
	cin >> N >> X;
	for (int i = 1; i <= N; i++) cin >> A[i];
	L = abs(X - A[1]);
	for (int i = 1; i <= N; i++) L = gcd(L, abs(X - A[i]));
	cout << L << endl;
	return 0;
}

Submission Info

Judge Result