
莫比乌斯反演
linbinwu123
peaceful life is enough
展开
-
2020杭电多校第六场 A Very Easy Math Problem 莫比乌斯反演 (HDU 6833)
A Very Easy Math Problem 题解 ∑a1=1n∑a2=1n⋅⋅⋅∑ax=1n(∏j=1xajk)f(gcd(a1,a2,...,an))gcd(a1,a2,...,an)=∑d=1ndf(d)∑a1=1n∑a2=1n⋅⋅⋅∑ax=1n(∏j=1xajk)[gcd(a1,a2,...,an)=d]=∑d=1ndkx+1f(d)∑a1=1⌊n/d⌋∑a2=1⌊n/d⌋⋅⋅⋅∑ax=1⌊n/d⌋(∏j=1xajk)∑t∣a1,t∣a2,...,t∣anμ(t)=∑d=1ndkx+1f(d)∑原创 2020-08-06 17:32:05 · 1410 阅读 · 2 评论 -
2020百度之星初赛1 Function 莫比乌斯反演 (HDU 6750)
Function 题解 明日更 代码 #include <bits/stdc++.h> using namespace std; typedef long long ll; const int MAX = 1e6 + 10; const int mod = 1e9 + 7; int vis[MAX], prime[MAX], num, mu[MAX], f[MAX]; void makeMobius(int siz) { mu[1] = 1, num = 0; for (int原创 2020-07-19 23:55:45 · 541 阅读 · 10 评论 -
莫比乌斯反演一些式子的推导(附题目)
前置内容 1.a∣ba|ba∣b意为aaa整除bbb 2.[a=b]={1,a=b0,a≠b[a=b]=\begin{cases} 1,a=b\\0,a ≠b \end{cases}[a=b]={1,a=b0,a=b 3.⌊a⌋\lfloor a \rfloor⌊a⌋意为对aaa向下取整 4.当n>k,n>dn>k,n>dn>k,n>d,有⌊⌊n/d⌋k⌋...原创 2020-04-10 16:40:14 · 1376 阅读 · 2 评论