codeforces 474F 区间gcd + 离散化

F. Ant colony

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Mole is hungry again. He found one ant colony, consisting of n ants, ordered in a row. Each ant i (1 ≤ i ≤ n) has a strength s_i.

In order to make his dinner more interesting, Mole organizes a version of «Hunger Games» for the ants. He chooses two numbers l and r (1 ≤ l ≤ r ≤ n) and each pair of ants with indices between l and r (inclusively) will fight. When two ants i and j fight, ant i gets one battle point only if s_i divides s_j (also, ant j gets one battle point only if s_j divides s_i).

After all fights have been finished, Mole makes the ranking. An ant i, with v_i battle points obtained, is going to be freed only if v_i = r - l, or in other words only if it took a point in every fight it participated. After that, Mole eats the rest of the ants. Note that there can be many ants freed or even none.

In order to choose the best sequence, Mole gives you t segments [l_i, r_i] and asks for each of them how many ants is he going to eat if those ants fight.

Input

The first line contains one integer n (1 ≤ n ≤ 10⁵), the size of the ant colony.

The second line contains n integers s₁, s₂, ..., s_n (1 ≤ s_i ≤ 10⁹), the strengths of the ants.

The third line contains one integer t (1 ≤ t ≤ 10⁵), the number of test cases.

Each of the next t lines contains two integers l_i and r_i (1 ≤ l_i ≤ r_i ≤ n), describing one query.

Output

Print to the standard output t lines. The i-th line contains number of ants that Mole eats from the segment [l_i, r_i].

Sample test(s)

Input

5
1 3 2 4 2
4
1 5
2 5
3 5
4 5

Output

4
4
1
1

Note

In the first test battle points for each ant are v = [4, 0, 2, 0, 2], so ant number 1 is freed. Mole eats the ants 2, 3, 4, 5.

In the second test case battle points are v = [0, 2, 0, 2], so no ant is freed and all of them are eaten by Mole.

In the third test case battle points are v = [2, 0, 2], so ants number 3 and 5 are freed. Mole eats only the ant 4.

In the fourth test case battle points are v = [0, 1], so ant number 5 is freed. Mole eats the ant 4.

就是简单的用线段数求一下区间gcd，然后统计一下区间内这个gcd的个数。

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <string>
#include <cstring>
#include <cmath>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <functional>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstdlib>
#include <ctime>
typedef long long ll;
//typedef pair<int,int> pii;
#define INF 1e9
#define MAXN 100005
#define MAXM 100
const int maxn = 100005;
const int mod = 1000000007 ;
#define eps 1e-6
#define PI 3.1415926535897932384626433
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define scan(n) scanf("%d",&n)
#define scan2(n,m) scanf("%d%d",&n,&m)
#define scans(s) scanf("%s",s);
#define ini(a) memset(a,0,sizeof(a))
#define FILL(a,n) fill(a,a+maxn,n)
#define out(n) printf("%d\n",n)
ll gcd(ll a,ll b) { return b==0?a:gcd(b,a%b);}
#define mk(n,m) make_pair(n,m)
using namespace std;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
vector<int> G[100005];
map<int,int> mp;
int g[maxn<<2];
int cnt = 0;
int insert(int n)
{
	if(mp.find(n) == mp.end())
		mp[n] = cnt++;
	return mp[n];
}
void pushup(int rt)
{
	g[rt] = gcd(g[rt<<1],g[rt<<1|1]);
}
void build(int l,int r,int rt)
{
	if(l == r)
	{
		scanf("%d",&g[rt]);
		int aa = insert(g[rt]);
		G[aa].push_back(l);
		return;
	}
	int m = (l+r) >> 1;
	build(lson);
	build(rson);
	pushup(rt);
}
int query(int L,int R,int l,int r,int rt)
{
	if (L <= l && r <= R)
	{
		return g[rt];
	}

	int m = (l+r)>>1;
	int t1 = -1,t2 = -1;
	if(L <= m) t1 = query(L,R,lson);
	if(R > m) t2 = query(L,R,rson);
	if(t1 != -1 && t2 != -1) return gcd(t1,t2);
	else if(t1 != -1) return t1;
	else if(t2 != -1) return t2;
	return 1;
}

int main()
{
#ifndef ONLINE_JUDGE
	freopen("in.txt","r",stdin);
	//   freopen("out.txt","w",stdout);
#endif
	int n;
	while(~scanf("%d",&n))
	{
		rep(i,maxn) G[i].clear();
		mp.clear();
		cnt = 0;
		build(1,n,1);
		int m;
		cin>>m;
		int L,R;
		while(m--)
		{
			scanf("%d%d",&L,&R);
			int gg = query(L,R,1,n,1);
			if(mp.find(gg) == mp.end())
			{
				printf("%d\n",R-L+1);
				continue;
			}
			gg = mp[gg];
			int p1 = lower_bound(G[gg].begin(),G[gg].end(),L) - G[gg].begin();
			int p2 = upper_bound(G[gg].begin(),G[gg].end(),R) - G[gg].begin();
			int ans = R-L+1 - (p2-p1);
			printf("%d\n",ans);
		}
	}
	return 0;
}