数论
到不了的远方-
I wanna be number one
展开
-
GCD(莫比乌斯反演)
GCD莫比乌斯反演入门题目:题解#include<iostream>#include<cstdio>#include<climits>#include<algorithm>#include<cstring>using namespace std;const int maxn=100005;int T,a,b,c,d...原创 2019-07-08 14:54:38 · 593 阅读 · 0 评论 -
Coprime Integers(莫比乌斯反演)
Coprime Integers题意:求a<=x<=b,c<=y<=d,(x,y)互质的对数。思路:莫比乌斯反演模板题。求对于区间[a,b]内的整数x和[c,d]内的y,满足gcd(x,y)=1的数对的个数。只要让F(t)=满足gcd(x,y)%t==0的数对个数f(t)=满足gcd(x,y)=t的数对个数,则F(t)和f(t)就存在莫比乌斯反演的关系了。...原创 2019-07-05 09:27:05 · 733 阅读 · 0 评论 -
P2257 YY的GCD 题解(莫比乌斯反演)
P2257 YY的GCD 题解题解:https://www.luogu.org/problemnew/solution/P2257#include<bits/stdc++.h>using namespace std;const int N=1e7+5;typedef long long ll;ll sum[N];int vis[N];int prime[N],mu...原创 2019-07-07 11:08:19 · 182 阅读 · 0 评论