fork download
copy 
  1. // ~~ icebear love attttt ~~
  2. #include <bits/stdc++.h>
  3. using namespace std;
  4.  
  5. typedef long long ll;
  6. typedef pair<int, int> ii;
  7. typedef pair<int, ii> iii;
  8.  
  9. template<class T>
  10.     bool minimize(T &a, const T &b) {
  11.         if (a > b) return a = b, true;
  12.         return false;
  13.     }
  14.  
  15. template<class T>
  16.     bool maximize(T &a, const T &b) {
  17.         if (a < b) return a = b, true;
  18.         return false;
  19.     }
  20.  
  21. #define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
  22. #define FORR(i,a,b) for(int i=(a); i>=(b); --i)
  23. #define REP(i, n) for(int i=0; i<(n); ++i)
  24. #define RED(i, n) for(int i=(n)-1; i>=0; --i)
  25. #define MASK(i) (1LL << (i))
  26. #define BIT(S, i) (((S) >> (i)) & 1)
  27. #define mp make_pair
  28. #define pb push_back
  29. #define fi first
  30. #define se second
  31. #define all(x) x.begin(), x.end()
  32. #define task "icebearat"
  33.  
  34. const int MOD = 1e9 + 7;
  35. const int inf = 1e9 + 27092008;
  36. const ll INF = 1e18 + 27092008;
  37. const int N = 2e5 + 5;
  38. int n, q, a[N], rmq[N][20];
  39. map<int, ll> cnt;
  40.  
  41. int getGcd(int l, int r) {
  42.     int k = __lg(r - l + 1);
  43.     return __gcd(rmq[l][k], rmq[r - MASK(k) + 1][k]);
  44. }
  45.  
  46. void init(void) {
  47.     cin >> n;
  48.     FOR(i, 1, n) cin >> a[i];
  49.     FOR(i, 1, n) rmq[i][0] = a[i];
  50.     cin >> q;
  51. }
  52.  
  53. void process(void) {
  54.     FOR(j, 1, 19) FOR(i, 1, n - MASK(j) + 1)
  55.         rmq[i][j] = __gcd(rmq[i][j - 1], rmq[i + MASK(j - 1)][j - 1]);
  56.     FOR(i, 1, n) {
  57.         int l = i;
  58.         while(l <= n) {
  59.             int low = l, high = n, res = 0, cur = getGcd(i, l);
  60.             while(low <= high) {
  61.                 int mid = (low + high) >> 1;
  62.                 if (getGcd(i, mid) == cur) res = mid, low = high + 1;
  63.                 else high = mid - 1;
  64.             }
  65.             cnt[cur] += res - l + 1;
  66.             l = res + 1;
  67.         }
  68.     }
  69.  
  70.     while(q--) {
  71.         int x; cin >> x;
  72.         if (cnt.find(x) == cnt.end()) cout << "0\n";
  73.         else cout << cnt[x] << '\n';
  74.     }
  75. }
  76.  
  77. int main() {
  78.     ios_base::sync_with_stdio(0);
  79.     cin.tie(0); cout.tie(0);
  80.     if (fopen(task".inp", "r")) {
  81.         freopen(task".inp", "r", stdin);
  82.         freopen(task".out", "w", stdout);
  83.     }
  84.     int tc = 1;
  85. //    cin >> tc;
  86.     while(tc--) {
  87.         init();
  88.         process();
  89.     }
  90.     return 0;
  91. }
  92.  
  93.  
Success #stdin #stdout 0s 5288KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/qrQy8u
language:
C++14 (gcc 8.3)
created:
2 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!