题目大意:求在a<=x<=b,c<=y<=d,满足gcd(x,y)是k的(x,y)的对数,注意不能重复;
题目解析:跟上题一样,只不过要开ll,而且需要减去重复的,只要减去cal(b,b)/2即可;
AC代码:
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
#define MAXN 100010
int a,b,c,d,k,p[MAXN+10],pcnt,n;
ll ans,sum[MAXN+10],mu[MAXN+10];
bool f[MAXN+10];
void Read(int &x){
char c;
while(c=getchar(),c!=EOF)
if(c>='0'&&c<='9'){
x=c-'0';
while(c=getchar(),c>='0'&&c<='9')
x=x*10+c-'0';
ungetc(c,stdin);
return;
}
}
void prepare(){
int i,j;
mu[1]=sum[1]=1;
for(i=2;i<=MAXN;i++){
if(!f[i])
p[++pcnt]=i,mu[i]=-1;
for(j=1;p[j]*i<=MAXN;j++){
f[p[j]*i]=1;
if(i%p[j]==0){
mu[p[j]*i]=0;
break;
}
mu[p[j]*i]=-mu[i];
}
sum[i]=sum[i-1]+mu[i];
}
}
ll cal(int n,int m){
int t=min(m,n),last=0,i;
ll ret=0;
for(i=1;i<=t;i=last+1){
last=min(n/(n/i),m/(m/i));
ret+=(ll)(sum[last]-sum[i-1])*(n/i)*(m/i);
}
return ret;
}
void solve(int a,int b,int c,int d,int k){
b/=k,d/=k;
ans=cal(b,d);
ll t = cal(b,b);
t/=2;
ans-=t;
}
int main()
{
int cas;
Read(cas);
int ca=1;
prepare();
while(cas--){
Read(a),Read(b),Read(c),Read(d),Read(k);
if(b>d)
{
int t = b;
b = d;
d = t;
}
if(k==0)
{
printf("Case %d: 0\n",ca++);
continue;
}
solve(a,b,c,d,k);
printf("Case %d: ",ca++);
printf("%lld\n",ans);
}
}