[POI2007]ZAP-Queries

出处：http://www.cnblogs.com/peng-ym/p/8660937.html （还是建议去看原文）

题目：链接：https://www.luogu.org/problemnew/show/P3455

#include<bits/stdc++.h>
#define LL long long
#define ULL unsigned long long
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define dep(i,j,k) for(int i=k;i>=j;i--)
#define INF 0x3f3f3f3f
#define mem(i,j) memset(i,j,sizeof(i))
#define make(i,j) make_pair(i,j)
#define pb push_back
using namespace std;
const int N=5e5+5;
bool vis[N];
int pre[N],sum[N],mu[N],tot;
void init() {mu[1]=1;rep(i,2,500000) {if(!vis[i]) { pre[++tot]=i; mu[i]=-1 ; }rep(j,1,tot) {if(i*pre[j]>N-5) break;vis[i*pre[j]]=1;if(i%pre[j]==0) break;mu[i*pre[j]]=-mu[i];}}rep(i,1,N-5) sum[i]=sum[i-1]+mu[i];
}
int main() {init();int t,n,m,k;scanf("%d",&t);while(t--) {scanf("%d %d %d",&n,&m,&k);int up=min(n/k,m/k);LL ans=0;for(int l=1,r;l<=up;l=r+1) {r=min((n/k)/((n/k)/l),(m/k)/((m/k)/l));ans+=1LL*((n/k)/l)*((m/k)/l)*(sum[r]-sum[l-1]);}printf("%lld\n",ans);}return 0;
}

View Code

转载于:https://www.cnblogs.com/Willems/p/10915306.html

[POI2007]ZAP-Queries相关推荐

BZOJ 1101: [POI2007]Zap
题目 1101: [POI2007]Zap Time Limit: 10 Sec Memory Limit: 162 MB Description FGD正在破解一段密码,他需要回答很多类似的问题: ...
BZOJ 1101: [POI2007]Zap( 莫比乌斯反演 )
求 answer = ∑ [gcd(x, y) = d] (1 <= x <= a, 1 <= y <= b) . 令a' = a / d, b' = b / d, 化简一下得 ...
[BZOJ1101][POI2007]Zap
1101: [POI2007]Zap Time Limit: 10 Sec Memory Limit: 162 MB Submit: 2732 Solved: 1164 [Submit][Stat ...
莫比乌斯函数（bzoj 1101: [POI2007]Zap）
莫比乌斯反演: http://blog.csdn.net/acdreamers/article/details/8542292 课件:https://wenku.baidu.com/view/fbec ...
BZOJ1101 洛谷3455：[POI2007]ZAP——题解
https://www.luogu.org/problemnew/show/3455#sub http://www.lydsy.com/JudgeOnline/problem.php?id=1101 ...
bzoj1101 [POI2007]Zap
Description FGD正在破解一段密码,他需要回答很多类似的问题:对于给定的整数a,b和d,有多少正整数对x,y,满足x<=a,y<=b,并且gcd(x,y)=d.作为FGD的同学 ...
BZOJ 1101([POI2007]Zap-满足x=ay=bgcd(x,y)=d的数对个数)
1101: [POI2007]Zap Time Limit: 10 Sec Memory Limit: 162 MB Submit: 1646 Solved: 577 [Submit][Statu ...
BZOJ 2301 [HAOI2011]Problem b
2301: [HAOI2011]Problem b Description 对于给出的n个询问,每次求有多少个数对(x,y),满足a≤x≤b,c≤y≤d,且gcd(x,y) = k,gcd(x,y)函 ...
BZOJ 3529: [Sdoi2014]数表
二次联通门 : BZOJ 3529: [Sdoi2014]数表 Latex的公式写起来略麻烦... 设$\LARGE F(x)=\sum_{d|x} \lfloor \dfrac xd \rfloor ...
2019.4.summary
2019.4.1 BZOJ1061: [Noi2008]志愿者招募真心有点难QAQ https://www.byvoid.com/zhs/blog/noi-2008-employee 看void爷的 ...

[POI2007]ZAP-Queries

[POI2007]ZAP-Queries相关推荐

最新文章

热门文章