Submission #3594637

---

Source Code Expand

#include<iostream>
static const int MAX=10e5;
using namespace std;
int lcm(int a,int b){
	while(b!=0){
		int c=b;
		b=a%b;
		a=c;
	}
	return a;
}
int main(void)
{
	int N,M;
		cin >> N >> M;
	int X[MAX];
	for(int j=0,i=0;j<N;j++){
		int a;
			cin >> a;
		if(a>M && i==j)
			X[i++]=M;
		X[i++]=a;
	}
	if(N==1){
		cout << X[N]-X[N-1] << endl;
		return 0;
	}
	
	int F=lcm(X[N]-X[N-1],X[N-1]-X[N-2]);
	for(int i=N-3;i>=0;i--)
		F=lcm(F,X[i+1]-X[i]);
	cout << F << endl;
	return 0;
}

Submission Info

Judge Result