#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <queue>
#include <string>
#include <string.h>
#include <map>
#include <vector>
typedef long long LL ;
const int maxn = 100000 ;
int prime[maxn+8] , primeSize ;
bool is[maxn+8] ;
int mu[maxn+8] ;
void mobius(){
memset(is , 0 , sizeof(is)) ;
primeSize = 0 ;
is[1] = mu[1] = 1 ;
for(int i = 2 ; i <= maxn ; i++){
if(! is[i]){
prime[primeSize++] = i ;
mu[i] = -1 ;
}
for(int j = 0 ; j < primeSize && i * prime[j] <= maxn ; j++){
is[i * prime[j]] = 1 ;
if(i % prime[j] == 0){
mu[i * prime[j]] = 0 ;
break ;
}
mu[i*prime[j]] = -mu[i] ;
}
}
}
int main()
{
std::ios::sync_with_stdio(false) ;
mobius() ;
int t , a , b , c , d , k ;
std::cin>>t ;
for(int cas = 1 ; cas <= t ; cas++){
std::cin>>a>>b>>c>>d>>k ;
if(k == 0){
printf("Case %d: 0\n" , cas) ;
continue ;
}
LL Lf = b/k ;
LL Rt = d/k ;
if(Lf > Rt) std::swap(Lf , Rt) ;
LL res = 0 , del = 0 ;
for(int i = 1 ; i <= Rt ; i++) res += mu[i] * (Rt/i) * (Lf/i) ;
for(int i = 1 ; i <= Lf ; i++) del += mu[i] * (Lf/i) * (Lf/i) ;
res -= del/2 ;
printf("Case %d: " , cas) ;
std::cout<<res<<std::endl ;
}
return 0 ;
}
分块
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <queue>
#include <string>
#include <string.h>
#include <map>
#include <vector>
typedef long long LL ;
const int maxn = 100000 ;
int prime[maxn+8] , primeSize ;
bool is[maxn+8] ;
int mu[maxn+8] ;
int sum[maxn+8] ;
void mobius(){
memset(is , 0 , sizeof(is)) ;
primeSize = 0 ;
is[1] = mu[1] = 1 ;
for(int i = 2 ; i <= maxn ; i++){
if(! is[i]){
prime[primeSize++] = i ;
mu[i] = -1 ;
}
for(int j = 0 ; j < primeSize && i * prime[j] <= maxn ; j++){
is[i * prime[j]] = 1 ;
if(i % prime[j] == 0){
mu[i * prime[j]] = 0 ;
break ;
}
mu[i*prime[j]] = -mu[i] ;
}
}
}
LL solve(LL big , LL les){
if(big < les) std::swap(big , les) ;
LL res = 0 ;
LL Lf , Rt ;
for(Lf = 1 ; Lf <= les ; Lf = Rt+1){
Rt = std::min(big/(big/Lf), les/(les/Lf)) ;
res += (sum[Rt] - sum[Lf-1]) * (big/Lf) * (les/Lf) ;
}
return res ;
}
int main()
{
std::ios::sync_with_stdio(false) ;
mobius() ;
sum[0] = 0 ;
for(int i = 1 ; i <= maxn ; i++) sum[i] = sum[i-1] + mu[i] ;
int t , a , b , c , d , k ;
std::cin>>t ;
for(int cas = 1 ; cas <= t ; cas++){
std::cin>>a>>b>>c>>d>>k ;
if(k == 0){
printf("Case %d: 0\n" , cas) ;
continue ;
}
LL Lf = b/k ;
LL Rt = d/k ;
if(Lf > Rt) std::swap(Lf , Rt) ;
printf("Case %d: " , cas) ;
std::cout<<solve(Rt , Lf) - solve(Lf , Lf)/2 <<std::endl ;
}
return 0 ;
}
点击打开链接转
【bzoj2820】YY的GCD
Description
神犇YY虐完数论后给傻×kAc出了一题
给定N, M,求1<=x<=N, 1<=y<=M且gcd(x, y)为质数的(x, y)有多少对
kAc这种傻×必然不会了,于是向你来请教……
多组输入
Input
第一行一个整数T 表述数据组数
接下来T行,每行两个正整数,表示N, M
Output
T行,每行一个整数表示第i组数据的结果
Sample Input
2
10 10
100 100
10 10
100 100
Sample Output
30
2791
2791
HINT
Source
假定n<m
∑isprime(p)∑a=1n∑b=1mgcd(a,b)==p
∑isprime(p)∑a=1n∑b=1mgcd(a,b)==p
∑isprime(p)∑a=1⌊np⌋∑b=1⌊mp⌋gcd(a,b)==1
∑isprime(p)∑a=1⌊np⌋∑b=1⌊mp⌋gcd(a,b)==1
∑isprime(p)∑a=1⌊np⌋∑b=1⌊mp⌋∑d|gcd(a,b)μ(d)
∑isprime(p)∑a=1⌊np⌋∑b=1⌊mp⌋∑d|gcd(a,b)μ(d)
∑isprime(p)∑a=1⌊np⌋∑b=1⌊mp⌋∑d|a∧d|bμ(d)
∑isprime(p)∑a=1⌊np⌋∑b=1⌊mp⌋∑d|a∧d|bμ(d)
∑isprime(p)∑d=1⌊np⌋μ(d)⌊npd⌋⌊mpd⌋
∑isprime(p)∑d=1⌊np⌋μ(d)⌊npd⌋⌊mpd⌋
将pd设为k
∑k=1n∑isprime(p)∧p|kμ(kp)⌊nk⌋⌊mk⌋
∑k=1n∑isprime(p)∧p|kμ(kp)⌊nk⌋⌊mk⌋
∑k=1nF(k)⌊nk⌋⌊mk⌋
∑k=1nF(k)⌊nk⌋⌊mk⌋
可以线筛预处理F,或者暴力枚举质数(这个复杂度我不能确定),按照素数粗略个数n/logn以及调和级数求和nlogn来看暴力的复杂度接近On
处理完F以后就是喜闻乐见的下底函数分块
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<set>
#include<ctime>
#include<vector>
#include<queue>
#include<algorithm>
#include<map>
#include<cmath>
#define inf 1000000000
#define N 10000000
#define pa pair<int,int>
#define ll long long
using namespace std;
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;
}
int T,n,m,cnt;
bool mark[10000005];
int pri[1000005],mu[10000005];
ll f[10000005];
void getphi()
{
mu[1]=1;
for(int i=2;i<=N;i++)
{
if(!mark[i])pri[++cnt]=i,mu[i]=-1;
for(int j=1;j<=cnt&&pri[j]*i<=N;j++)
{
mark[i*pri[j]]=1;
if(i%pri[j]==0){mu[i*pri[j]]=0;break;}
else mu[i*pri[j]]=-mu[i];
}
}
for(int i=1;i<=cnt;i++)
{
int p=pri[i];
for(int j=1;j*p<=N;j++)f[j*p]+=mu[j];
}
for(int i=1;i<=N;i++)f[i]+=f[i-1];
}
int main()
{
getphi();
T=read();
while(T--)
{
ll ans=0;
n=read();m=read();
if(n>m)swap(n,m);
for(int i=1,j;i<=n;i=j+1)
{
j=min(n/(n/i),m/(m/i));
ans+=(f[j]-f[i-1])*(n/i)*(m/i);
}
printf("%lld\n",ans);
}
return 0;
}