首先对于
code：
#include<set>#include<map>#include<deque>#include<queue>#include<stack>#include<cmath>#include<ctime>#include<bitset>#include<string>#include<vector>#include<cstdio>#include<cstdlib>#include<cstring>#include<climits>#include<complex>#include<iostream>#include<algorithm>#define ll long long#define lowbit(x) x&(-x)using namespace std;void up(int &x,int y){if(x<y)x=y;}void down(int &x,int y){if(x>y)x=y;}const int maxn = 101000;int p[maxn],PRi,miu[maxn],s[maxn];bool v[maxn];void pre(){ memset(v,false,sizeof v); miu[1]=s[1]=1; pri=0; for(int i=2;i<maxn;i++) { if(!v[i]) { miu[i]=-1; p[++pri]=i; } for(int j=1;j<=pri;j++) { int k=i*p[j]; if(k>=maxn) break; v[k]=true; if(i%p[j]==0) { miu[k]=0; break; } miu[k]=-miu[i]; } s[i]=s[i-1]+miu[i]; }}int solve(int n,int m,int k){ int re=0; n/=k; m/=k; k=min(n,m); int r; for(int l=1;l<=k;l=r+1) { r=min(n/(n/l),m/(m/l)); re+=(s[r]-s[l-1])*(n/l)*(m/l); } return re;}int main(){ pre(); int t; scanf("%d",&t); while(t--) { int a,b,c,d,k; scanf("%d%d%d%d%d",&a,&b,&c,&d,&k); int a1=solve(b,d,k); int a2=solve(a-1,d,k); int a3=solve(b,c-1,k); int a4=solve(a-1,c-1,k); printf("%d/n",a1-a2-a3+a4); } return 0;}新闻热点
疑难解答
