fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14. int x = 1;
  15. a %= mod;
  16. while (b) {
  17. if (b & 1) x = (x * a) % mod;
  18. a = (a * a) % mod;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28. int gcd(int a, int b){
  29. if(b==0) return a;
  30. return gcd(b, a%b);
  31. }
  32.  
  33. vector<int> a;
  34.  
  35. int consistency(int n){
  36.  
  37. int gc = 0;
  38. int i = 0, j = n-1;
  39.  
  40. while(i<j){
  41. int diff = abs(a[i]-a[j]);
  42. gc = gcd(gc, diff);
  43. i++;
  44. j--;
  45. }
  46.  
  47. return gc;
  48. }
  49.  
  50.  
  51.  
  52.  
  53.  
  54.  
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64. int practice(int n){
  65.  
  66.  
  67. return 0;
  68. }
  69.  
  70.  
  71.  
  72.  
  73.  
  74. void solve() {
  75.  
  76. int n;
  77. cin>> n;
  78.  
  79. a.resize(n);
  80. for(int i=0; i<n; i++) cin >> a[i];
  81.  
  82. cout << consistency(n) << endl;
  83.  
  84.  
  85. }
  86.  
  87.  
  88.  
  89.  
  90.  
  91. int32_t main() {
  92. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  93.  
  94. int t = 1;
  95. cin >> t;
  96. while (t--) {
  97. solve();
  98. }
  99.  
  100. return 0;
  101. }
Success #stdin #stdout 0.01s 5320KB
stdin
4
2
1 2
8
3 0 1 2 0 3 2 1
1
0
3
100 1 1000000000
stdout
1
2
0
999999900