codeforces 691F Couple Cover 暴力

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long LL;
const int N  = 3e6;
const LL mod = 1e9+7;
LL n,m,sum[N+5],c[N+5];
int main(){
  scanf("%I64d",&n);
  int mx=0;
  for(int i=1;i<=n;++i){
    int x;scanf("%d",&x);++c[x];
    mx=max(x,mx);
  }
  for(int i=1;i<=mx;++i){
    for(int j=1;j<=mx;++j){
       if(1ll*i*j>N)break;
       if(i==j)sum[i*j]+=c[i]*(c[i]-1);
       else sum[i*j]+=c[i]*c[j];
    }
  }
  for(int i=1;i<=N;++i)sum[i]+=sum[i-1];
  scanf("%I64d",&m);
  while(m--){
    int p;
    scanf("%d",&p);
    printf("%I64d\n",n*(n-1)-sum[p-1]);
  }
  return 0;
}