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.  
  34. vector<int> a;
  35. vector<int> b;
  36.  
  37. vector<int> consistency(int m, int n){
  38.  
  39. int gc = 0;
  40. for(int i=1; i<m; i++) gc = gcd(gc, abs(a[i]-a[i-1]));
  41.  
  42. vector<int> ans(n);
  43. for(int j=0; j<n; j++){
  44. ans[j] = gcd(a[0] + b[j], gc);
  45. }
  46.  
  47. return ans;
  48. }
  49.  
  50.  
  51.  
  52.  
  53.  
  54.  
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64. vector<int> practice(int m, int n){
  65.  
  66.  
  67. }
  68.  
  69.  
  70.  
  71.  
  72.  
  73. void solve() {
  74.  
  75. int m, n;
  76. cin>> m >> n;
  77.  
  78. a.resize(m);
  79. for(int i=0; i<m; i++) cin >> a[i];
  80.  
  81. b.resize(n);
  82. for(int i=0; i<n; i++) cin >> b[i];
  83.  
  84. auto ans = consistency(m, n);
  85.  
  86. for(auto& t : ans) cout << t << " "; cout << endl;
  87.  
  88.  
  89. }
  90.  
  91.  
  92.  
  93.  
  94.  
  95. int32_t main() {
  96. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  97.  
  98. int t = 1;
  99. // cin >> t;
  100. while (t--) {
  101. solve();
  102. }
  103.  
  104. return 0;
  105. }
Success #stdin #stdout 0.01s 5316KB
stdin
4 4
1 25 121 169
1 2 7 23
stdout
2 3 8 24