合并相同的gcd。。。。
#include <iostream>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 300005
#define maxm 300006
#define eps 1e-10
#define mod 1315423911
#define INF 1e17
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid
#define rson o<<1 | 1, mid+1, R
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
LL gcd(LL _a, LL _b){if(!_b) return _a;else return gcd(_b, _a%_b);}
// head
int next[maxn];
int num[maxn];
int a[maxn];
int b[maxn];
map<int, LL> mpp;
int n, m;
void read(void)
{
scanf("%d", &n);
for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
for(int i = 1; i <= n; i++) next[i] = i+1;
scanf("%d", &m);
for(int i = 1; i <= m; i++) scanf("%d", &b[i]);
}
void work(void)
{
int now;
for(int i = n; i >= 1; i--) {
now = i;
for(int j = i; j <= n; j = next[j]) {
a[j] = gcd(a[j], a[now]);
if(a[j] == a[now]) next[now] = next[j];
else now = j;
if(mpp.count(a[j])) mpp[a[j]] += next[j] - j;
else mpp[a[j]] = next[j] - j;
}
}
for(int i = 1; i <= m; i++) printf("%I64d\n", mpp[b[i]]);
}
int main(void)
{
read();
work();
return 0;
}
