#include<algorithm>
#include<iostream>
#include<cstdio>
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
struct data{
int x,p,k,f,xh;
}q[200001];
int n,m,mx,top,a[100001],f1[101][101],f2[100001],ans[2][100001];
inline bool cmp(data a,data b){
return a.x<b.x;
}
void add(int x){
for(int i=1;i<=100;i++)f1[i][x%i]++;
f2[x]++;
}
int main(){
n=read();m=read();
for(int i=1;i<=n;i++){
a[i]=read();mx=max(mx,a[i]);
}
for(int i=1;i<=m;i++){
int l=read(),r=read(),p=read(),k=read();
q[++top].x=l-1;q[top].p=p;q[top].k=k;q[top].f=0;q[top].xh=i;
q[++top].x=r;q[top].p=p;q[top].k=k;q[top].f=1;q[top].xh=i;
}
sort(q+1,q+top+1,cmp);
int now=0;
for(int i=1;i<=top;i++){
while(now<q[i].x){now++;add(a[now]);}
int p=q[i].p,k=q[i].k;
if(p<=100)ans[q[i].f][q[i].xh]=f1[p][k];
else for(int j=k;j<=mx;j+=p)ans[q[i].f][q[i].xh]+=f2[j];
}
for(int i=1;i<=m;i++)
printf("%d\n",ans[1][i]-ans[0][i]);
return 0;
}
2506: calc
最新推荐文章于 2018-01-28 21:47:41 发布