Submission #4050823

---

Source Code Expand

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

int gcd(long a,long b){
	if(b==0) return a;
  	else return gcd(b,a%b);
}
int main() {
	int n,x;cin>>n>>x;
  	vector<int> a(n);
  	vector<int> b(n);
  	for(int i=0;i<n;i++){
      	cin>>a[i];
      	b[i]=abs(a[i]-x);
    }
  	sort(b.begin(),b.end());
  	int ans=gcd(b[1],b[0]);
  	for(int i=2;i<n;i++){
    	ans=gcd(gcd(b[i],b[i-1]),ans);
    }
  cout<<ans<<endl;
}

Submission Info

Judge Result