bzoj2301: [HAOI2011]Problem b

代码：

#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<math.h>
#include<cstdio>
#include<vector>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int N=50010;
const int MAX=151;
const int MOD=1000000007;
const int MOD1=100000007;
const int MOD2=100000009;
const int INF=2100000000;
const double EPS=0.00000001;
typedef long long ll;
typedef unsigned long long uI64;
{
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;
}
int a[N],bo[N],mu[N],sum[N];
void deal() {
int i,j,k,n=50000;
memset(bo,0,sizeof(bo));
mu[1]=1;sum[0]=k=0;
for (i=2;i<=n;i++) {
if (!bo[i]) { a[++k]=i;mu[i]=-1; }
for (j=1;j<=k;j++) {
if (a[j]*i>n) break ;
bo[a[j]*i]=1;
if (i%a[j]==0) { mu[a[j]*i]=0;break ; }
mu[a[j]*i]=-mu[i];
}
}
for (i=1;i<=n;i++) sum[i]=sum[i-1]+mu[i];
}
ll get(int n,int m) {
if (!n||!m) return 0;
if (n>m) { n^=m;m^=n;n^=m; }
int i,last;
ll ret=0;
for (i=1;i<=n;i=last+1) {
last=min(n/(n/i),m/(m/i));
ret+=(ll)(n/i)*(m/i)*(sum[last]-sum[i-1]);
}
return ret;
}
int main()
{
int a,b,c,d,k,t;
ll ans;
scanf("%d", &t);
deal();
while (t--) {
scanf("%d%d%d%d%d", &a, &b, &c, &d, &k);
ans=get(b/k,d/k)-get(b/k,(c-1)/k)-get((a-1)/k,d/k)+get((a-1)/k,(c-1)/k);
printf("%lld\n", ans);
}
return 0;
}

/*
2
2 5 1 5 1
1 5 1 5 2
*/


©️2019 CSDN 皮肤主题: 大白 设计师: CSDN官方博客