题解 | 一道GCD问题

#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using PII=pair<ll,ll>;
using PIII=pair<int,pair<int,int>>;
const ld ESP = 1e-10;
const ld PI = acosl(-1);
const int N=1e6+10;
const int M=2e5+10;
// const int mod = 1000000007;
const int mod = 998244353;
//随机化
random_device rd;
mt19937 gen(rd());
uniform_int_distribution<> dis(1, 1000000000);

void solve(){
    int n;
    cin>>n;
    int a[n+1];
    int d=0;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        d=gcd(d,a[i]);
    }
    int ds=0;
    for(int i=2;i<=n;i++){
        ds=gcd(ds,abs(a[i]-a[i-1]));
    }
    if(ds>d){
        if(a[1]%ds==0){
            cout<<ds<<" "<<0<<'\n';
        }else{
            cout<<ds<<" "<<ds-a[1]%ds<<'\n';
        }
    }else{
        cout<<d<<" "<<0<<'\n';
    }    
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int _=1;
    // cin>>_;
    while(_--){
        solve();
    }
    return 0;
}