Submission #3770070

---

Source Code Expand

#include<stdio.h>
#include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
#include<string>
#include<math.h>
#include <numeric>

using namespace std;
typedef long long ll;

#define REP(i,n) for(int i=0;i<n;++i)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define pn(s) cout << (#s) << " " << (s) << endl

const ll mod = 1e9 + 7;
const ll inf = 1e18;

void printVector(vector<ll> A){
    cout << "[vector]" << endl;
    for(int i=0; i<A.size(); i++){
        cout << A[i] << " ";
    }
    cout << endl;
}

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

ll x[100000] = {};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    // input
    int N, X;
    cin >> N >> X;

    FOR(i, 0, N){
        ll val;
        cin >> val;
        x[i] = abs(val - X); 
    }

    ll answer = x[0];
    FOR(i, 1, N){
        answer = gcd(answer, x[i]);
    }

    p(answer);
    
    return 0;
}

Submission Info

Judge Result