385C.cpp

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <stack>
#include <cassert>
#include <fstream>
#include <cstring>
#include <numeric>
#include <ctype.h>
#include <stdio.h>
#define MOD 100000000   
#define exit return 0
#define inf 10000000000
#define exit return 0
#define PS system("pause")
#define S 100007
#define mx(a,b) a>b?a:b
#define R0(i,n) for (i = 0; i < n; i++)
#define R1(i,n) for (i = 1; i <= n; i++)
#define MS(a,x) memset(x, a, sizeof(x));
#define left (v<<1)
#define right (left|1)
#define mid ((tl+tr)>>1)
#define SZ(x) ((int)x.size())
#define MX(a,b)a>b?a:b
const double eps = 1e-10;


using namespace std;
using ll = long long;
using ul = unsigned long long;
using PII = pair<int, int>;
const int NN = 10000001;
//vector<set<int>>gr(NN);
//int cc[NN], ff[NN];
//int dp[211][2][11][11];
int n, n1, k1, k2, k;
int m, s, x, c, d, a, e, q;
int dd;
int pr[NN + 2], answ[NN + 2], pref[NN + 2];
int fxx[NN + 2];
void go(){

	pr[0] = pr[1] = 1;
	for (int i = 2; i <= NN; i++){
		if (!pr[i]){
			int tt = 0;
			for (int j = i; j <= NN; j += i){
				pr[j] = 1;
				tt += fxx[j];
			}
			answ[i] = tt;
		}
	}

	pref[0] = pref[1] = 0;
	for (int i = 2; i <= NN; i++){
		pref[i] = pref[i - 1] + answ[i];
	}

}


int main(){
	scanf("%d", &n);
	for (int i = 0; i < n; i++){
		scanf("%d", &a);
		fxx[a]++;
	}
	go();
	scanf("%d", &m);
	while (m--){
		int le, ri;
		scanf("%d %d", &le, &ri);
		if (ri > NN)ri = NN;
		if (le > NN)le = NN;
		printf("%d\n", pref[ri] - pref[le - 1]);
	}
	exit;
}