近视后人 WA on #12 #13

inline void solvek(long long k)
{
	memset(kuai,0x3f,sizeof(kuai));
	for(long long i=1;i<=n;i++) kuai[i/v]=min(kuai[i/v],a[i]%k);
	for(long long i=le[k];i<=ri[k];i++)
	{
		long long minn=2e9,L=q[i].l,R=q[i].r;
		if(L/v==R/v)
		{
			for(long long x=L;x<=R;x++) minn=min(minn,a[x]%k);
		}
		else
		{
			if(L%v!=0)
			{
				long long end=L/v*v+v;
				for(long long x=L;x<end&&x<=n;x++) minn=min(minn,a[x]%k);
			}
			for(long long x=L/v+1;x<R/v;x++) minn=min(minn,kuai[x]);
			if(R%v!=v-1&&R%v!=0)
			{
				long long start=R/v*v;
				for(long long x=start;x<=R;x++) minn=min(minn,a[x]%k);
			}
			else if(R%v==v-1) minn=min(minn,kuai[R/v]);
		}
		ans[q[i].id]=minn;
	}
}

inline void solvek(long long k)
{
	memset(kuai,0x3f,sizeof(kuai));
	for(long long i=1;i<=n;i++) kuai[i/v]=min(kuai[i/v],a[i]%k);
	for(long long i=le[k];i<=ri[k];i++)
	{
        long long minn=2e9,L=q[i].l,R=q[i].r;
		if(L/v==R/v)
		{
			for(long long x=L;x<=R;x++) minn=min(minn,a[x]%k);
		}
		else
		{
			int Lp=L/v*v+v-1,Rp=R/v*v;
    		for(int i=L;i<=Lp;i++) minn=min(minn,a[i] % k);
    		for(int i=Rp;i<=R;i++) minn=min(minn,a[i] % k);
    		for(int i=L/v+1;i<R/v;i++) minn=min(minn,kuai[i]);
		}
		ans[q[i].id]=minn;
	}
}