思路:
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 2005;
int a[maxn], b[maxn], c[maxn];
signed main(){
int n;
cin >> n;
int gcd = 0;
for(int i = 1; i <= n; i++){
cin >> a[i];
}
for(int i = 1; i <= n; i++) cin >> b[i];
for(int i = 1; i <= n; i++) cin >> c[i];
int minn = 1e18, maxx = 0;
sort(a + 1, a + n + 1);
for(int i = 2; i <= n; i++){
gcd = __gcd(gcd, a[i] - a[i - 1]);
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
int x = b[i] + c[j];
int t = __gcd(gcd, a[1] + x);
minn = min(minn, t);
maxx = max(maxx, t);
}
}
cout << minn << ' ' << maxx;
return 0;
}