解题思路:每一项与第一项的差一定是d的倍数,当d != 0 时, (a末 - a初) / d + 1 ---- 让公差d最大即可,当d == 0 时,答案为 n
#include<bits/stdc++.h>
#define x first
#define y second
#define mem1(h) memset(h,-1,sizeof h)
#define mem0(h) memset(h,0,sizeof h)
#define mcp(a,b) memcpy(a,b,sizeof b)
using namespace std;
typedef long long LL;
typedef unsigned long long ull;
typedef pair<int,int>PII;
typedef pair<double,double>PDD;
namespace IO{
inline LL read(){
LL o=0,f=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9'){o=o*10+c-'0';c=getchar();}
return o*f;
}
}using namespace IO;
const int N=1e5+7,M=2e5+7,INF=0x3f3f3f3f,mod=1e9+7,P=131;
int n;
int a[N];
int gcd(int a,int b){
return b==0?a:gcd(b,a%b);
}
int main(){
n=read();
for(int i=0;i<n;i++){
a[i]=read();
}
sort(a,a+n);
int d=0;
for(int i=1;i<n;i++){
d=gcd(d,a[i]-a[0]);
}
int ans;
if(d!=0)ans=(a[n-1]-a[0])/d+1;
else ans=n;
cout<<ans<<endl;
return 0;
}