莫比乌斯反演
wang3312362136
这个作者很懒,什么都没留下…
展开
-
BZOJ 3512 DZY Loves Math IV
题目链接https://lydsy.com/JudgeOnline/problem.php?id=3512题解考虑枚举iii,定义g(n,m)=∑i=1mφ(in)g(n,m)=\sum_{i=1}^m \varphi(in)g(n,m)=i=1∑mφ(in)假设n=∏kpkakn=\prod_{k}p_k^{a_k}n=k∏pkak令n′=∏kpkr=∏kpkak...原创 2019-01-10 16:22:21 · 200 阅读 · 0 评论 -
BZOJ 2154 Crash的数字表格 BZOJ 2693 jzptab
题目链接https://lydsy.com/JudgeOnline/problem.php?id=2154https://lydsy.com/JudgeOnline/problem.php?id=2693题解∑i=1n∑j=1mlcm(i,j)=∑i=1n∑j=1mijgcd(i,j)=∑T=1min(n,m)S(⌊nT⌋,⌊mT⌋)T∑d∣Tμ(d)d\begin{aligned}...原创 2019-01-02 21:25:19 · 219 阅读 · 0 评论 -
BZOJ 2440 [中山市选2011]完全平方数
题目链接https://lydsy.com/JudgeOnline/problem.php?id=2440题解发现答案满足可二分性,考虑二分答案,假设值为xxx,容斥之后发现[1,x][1,x][1,x]中不是完全平方数的个数就是∑i=1xμ(i)⌊xi2⌋\sum_{i=1}^{\sqrt{x}} \mu(i)\lfloor\frac{x}{i^2}\rfloori=1∑xμ(i...原创 2019-01-02 21:29:00 · 309 阅读 · 0 评论 -
BZOJ 2671 Calc
题目链接https://lydsy.com/JudgeOnline/problem.php?id=2671题解对于一对(a,b)(a,b)(a,b)满足a+b∣aba+b\mid aba+b∣ab,假设d=gcd(a,b),a=xd,b=ydd=\gcd(a,b),a=xd,b=ydd=gcd(a,b),a=xd,b=yd,那么xd+yd∣xyd2x+y∣xydx+y∣dxd+yd\m...原创 2019-01-02 21:42:34 · 282 阅读 · 0 评论 -
BZOJ 2818 Gcd BZOJ 2820 YY的GCD
题目链接https://lydsy.com/JudgeOnline/problem.php?id=2818https://lydsy.com/JudgeOnline/problem.php?id=2820题解∑p∑i=1n∑j=1m[gcd(i,j)=p]=∑T=1min(n,m)⌊nT⌋⌊mT⌋∑p∣Tμ(Tp)\begin{aligned}& \sum_{p} ...原创 2019-01-02 21:52:24 · 195 阅读 · 0 评论 -
BZOJ 3202 [Sdoi2013]项链
题目链接https://lydsy.com/JudgeOnline/problem.php?id=3202题解这题可以分成两部分:一个是统计珠子的个数,一个是统计项链的个数。对于珠子的个数,记S3S3S3为gcd=1\gcd=1gcd=1的三个数的个数,S2S2S2为gcd=1\gcd=1gcd=1的两个数的个数,S1S1S1为gcd=1\gcd=1gcd=1的一个数的个数,容易发现...原创 2019-01-03 09:30:22 · 269 阅读 · 0 评论 -
BZOJ 3309 DZY Loves Math
题目链接https://lydsy.com/JudgeOnline/problem.php?id=3309题解莫比乌斯反演∑i=1n∑j=1mf(gcd(i,j))=∑T=1min(n,m)⌊nT⌋⌊mT⌋∑d∣Tμ(Td)f(d)\begin{aligned}& \sum_{i=1}^n \sum_{j=1}^m f(\gcd(i,j))\\= &amp...原创 2019-01-03 09:49:21 · 157 阅读 · 0 评论 -
BZOJ 5332 [Sdoi2018]旧试题
题目链接https://lydsy.com/JudgeOnline/problem.php?id=5332题解反演得到∑d=1min(A,B)μ(d)∑e=1min(A,C)μ(e)∑f=1min(B,C)μ(f)F(lcm(d,e),A)F(lcm(d,f),B)F(lcm(e,f),C)\sum_{d=1}^{\min(A,B)}\mu(d)\sum_{e=1}^{\min(A...原创 2019-01-08 09:03:15 · 318 阅读 · 0 评论 -
BZOJ 3434 [Wc2014]时空穿梭
题目链接https://lydsy.com/JudgeOnline/problem.php?id=3434题解枚举选取的第一个点和最后一个点的坐标差∑ΔP=(Δx1,Δx2,⋯ ,Δxn)(gcd(ΔP)−1c−2)∏k=1n(mi−Δxi+1)\sum_{\Delta P=(\Delta x_1,\Delta x_2,\cdots,\Delta x_n)}...原创 2019-01-08 09:25:22 · 251 阅读 · 0 评论 -
BZOJ 4816 [Sdoi2017]数字表格
题目链接https://lydsy.com/JudgeOnline/problem.php?id=4816题解反演∏T=1min(n,m)(∏d∣Tfib(d)μ(d))⌊n/d⌋⌊m/d⌋\prod_{T=1}^{\min(n,m)}(\prod_{d|T}fib(d)^{\mu(d)})^{\lfloor n/d\rfloor\lfloor m/d\rfloor}T=1∏min(...原创 2019-01-08 09:30:23 · 210 阅读 · 0 评论 -
BZOJ 4916 神犇和蒟蒻
题目链接https://lydsy.com/JudgeOnline/problem.php?id=4916题解∑i=1Nμ(i2)=1∑i=1Nφ(i2)=∑i=1Niφ(i)\sum_{i=1}^N \mu(i^2)=1\\\sum_{i=1}^N \varphi(i^2)=\sum_{i=1}^N i\varphi(i)i=1∑Nμ(i2)=1i=1∑Nφ(i2)=i=1∑N...原创 2019-01-08 09:44:41 · 194 阅读 · 0 评论 -
BZOJ 4652 [Noi2016]循环之美
题目链接https://lydsy.com/JudgeOnline/problem.php?id=4652题解容易发现,若ij\frac{i}{j}ji在kkk进制下为纯循环小数,那么必定有ikl=imod  jkl=1mod  jik^l=i\mod{j}\\k^l=1\...原创 2019-01-09 20:26:56 · 213 阅读 · 0 评论 -
BZOJ 2005 [Noi2010]能量采集
题目链接https://lydsy.com/JudgeOnline/problem.php?id=2005题解容易发现,植物(x,y)(x,y)(x,y)和机器之间的连线上植物的数量就是gcd(x,y)\gcd(x,y)gcd(x,y)。因此答案就是∑i=1n∑j=1m(2gcd(i,j)−1)=2∑i=1n∑j=1mgcd(i,j)−nm\begin{aligned}&...原创 2019-01-02 20:45:35 · 206 阅读 · 0 评论 -
Luogu P4844 LJJ爱数数
题目链接https://www.luogu.org/problemnew/show/P4844题解1a+1b=1c\frac{1}{a}+\frac{1}{b}=\frac{1}{c}a1+b1=c1即bc+ac=(a+b)c=abbc+ac=(a+b)c=abbc+ac=(a+b)c=ab设g=gcd(a,b),A=ag,B=bgg=\gcd(a,b),A=\frac...原创 2019-01-07 11:45:26 · 395 阅读 · 0 评论 -
Luogu P4240 毒瘤之神的考验
题目链接https://www.luogu.org/problemnew/show/P4240题解容易发现φ(ij)=φ(i)φ(j)gcd(i,j)φ(gcd(i,j))\varphi(ij)=\frac{\varphi(i)\varphi(j)\gcd(i,j)}{\varphi(\gcd(i,j))}φ(ij)=φ(gcd(i,j))φ(i)φ(j)gcd(i,j)因此可...原创 2019-01-07 11:28:46 · 314 阅读 · 0 评论 -
BZOJ 4815 [Cqoi2017]小Q的表格
题目链接https://lydsy.com/JudgeOnline/problem.php?id=4815题解观察发现bf(a,a+b)=(a+b)f(a,b)bf(a,a+b)=(a+b)f(a,b)bf(a,a+b)=(a+b)f(a,b)很像更相减损术的式子,稍加推导可得f(a,b)=agcd(a,b)bgcd(a,b)f(gcd(a,b),gcd(a,b))f(a,b)=...原创 2019-01-10 16:32:16 · 259 阅读 · 0 评论 -
Luogu P4916 魔力环
题目链接https://www.luogu.org/problemnew/show/P4916题解将项链用序列表示,111代表黑色,000代表白色,对于一个合法序列,它必定能表示成ddd个循环节,每个循环节nd\frac{n}{d}dn个珠子,其中md\frac{m}{d}dm个黑色珠子。假设循环节长度为nnn的合法序列方案数为f(n)f(n)f(n)(不考虑旋转后相同的情况),容易发现...原创 2019-01-10 16:54:11 · 303 阅读 · 0 评论 -
莫比乌斯反演+杜教筛 题表
“入门”难度BZOJ 3994 [SDOI2015]约数个数和BZOJ 4805 欧拉函数求和BZOJ 2440 [中山市选2011]完全平方数Luogu P3935 CalculatingLuogu P4450 双亲数BZOJ 4916 神犇和蒟蒻需要一点“小”技巧BZOJ 2005 [Noi2010]能量采集BZOJ 2154 Crash的数字表格 BZOJ 2693 jzp...原创 2019-01-10 17:15:22 · 395 阅读 · 0 评论 -
BZOJ 3529 [Sdoi2014]数表
题目链接https://lydsy.com/JudgeOnline/problem.php?id=3529题解题目要求∑i=1n∑j=1mσ0(gcd(i,j))[σ0(gcd(i,j))≤a]\sum_{i=1}^n\sum_{j=1}^m \sigma_0(\gcd(i,j))[\sigma_0(\gcd(i,j))\leq a]i=1∑nj=1∑mσ0(gcd(i,j)...原创 2019-01-06 21:45:16 · 155 阅读 · 0 评论 -
BZOJ 4176 Lucas的数论
题目链接https://lydsy.com/JudgeOnline/problem.php?id=3994题解莫比乌斯反演得到∑k=1nμ(k)∑i=1⌊n/k⌋σ0(i)∑i=1⌊n/k⌋σ0(i)\sum_{k=1}^{n} \mu(k)\sum_{i=1}^{\lfloor n/k\rfloor}\sigma_0(i)\sum_{i=1}^{\lfloor n/k\rfloor}\...原创 2019-01-07 10:43:07 · 195 阅读 · 0 评论 -
BZOJ 3994 [SDOI2015]约数个数和
题目链接https://lydsy.com/JudgeOnline/problem.php?id=3994题解莫比乌斯反演得到∑k=1nμ(k)∑i=1⌊n/k⌋σ0(i)∑i=1⌊n/k⌋σ0(i)\sum_{k=1}^{n} \mu(k)\sum_{i=1}^{\lfloor n/k\rfloor}\sigma_0(i)\sum_{i=1}^{\lfloor n/k\rfloor}\...原创 2019-01-07 10:45:35 · 210 阅读 · 0 评论 -
BZOJ 3930 [CQOI2015]选数
题目链接https://lydsy.com/JudgeOnline/problem.php?id=3930题解反演得到∑i=1⌊h/k⌋μ(i)(⌊hki⌋−⌊l−1ki⌋)n\sum_{i=1}^{\lfloor h/k\rfloor} \mu(i) (\lfloor \frac{h}{ki}\rfloor-\lfloor\frac{l-1}{ki}\rfloor)^ni=1∑⌊h/...原创 2019-01-07 10:51:48 · 188 阅读 · 0 评论 -
BZOJ 4407 于神之怒加强版
题目链接https://lydsy.com/JudgeOnline/problem.php?id=4407题解反演∑T=1min(n,m)⌊nT⌋⌊mT⌋∑d∣Tdkμ(Td)\sum_{T=1}^{\min(n,m)}\lfloor\frac{n}{T}\rfloor\lfloor\frac{m}{T}\rfloor\sum_{d|T}d^k\mu(\frac{T}{d})T=1∑...原创 2019-01-07 10:58:52 · 416 阅读 · 2 评论 -
BZOJ 4805 欧拉函数求和
题目链接https://lydsy.com/JudgeOnline/problem.php?id=4805题解直接杜教筛筛φ\varphiφ函数即可。代码#include <map>#include <cstdio>#include <algorithm>int read(){ int x=0,f=1; char ch=getchar...原创 2019-01-07 11:00:34 · 226 阅读 · 1 评论 -
Luogu P3935 Calculating
题目链接https://www.luogu.org/problemnew/show/P3935题解可以看出fff函数就是约数个数。直接O(n)O(\sqrt{n})O(n)求约数个数函数的前缀和即可。代码#include <cstdio>template<typename T>T read(){ T x=0; int f=1; char ch...原创 2019-01-07 11:03:47 · 228 阅读 · 0 评论 -
Luogu P4450 双亲数
题目链接https://www.luogu.org/problemnew/show/P4450题解直接反演以下就好了,甚至都不用整除分块……代码#include &lt;cstdio&gt;#include &lt;algorithm&gt;int read(){ int x=0,f=1; char ch=getchar(); while((ch&lt;'0')||(...原创 2019-01-07 11:06:46 · 225 阅读 · 0 评论 -
Luogu P3768 简单的数学题
题目链接https://www.luogu.org/problemnew/show/P3768题解反演一发得到∑T=1n(∑i=1⌊n/T⌋i)2T2φ(T)\sum_{T=1}^n (\sum_{i=1}^{\lfloor n/T\rfloor}i)^2T^2\varphi(T)T=1∑n(i=1∑⌊n/T⌋i)2T2φ(T)设f(T)=T2φ(T)f(T)=T^2\var...原创 2019-01-07 11:13:47 · 280 阅读 · 0 评论 -
BZOJ 4913 [Sdoi2017] 遗忘的集合
题目链接https://lydsy.com/JudgeOnline/problem.php?id=4913题解令ai=0/1a_i=0/1ai=0/1表示元素iii是否在集合中,那么元素iii的生成函数为(11−xi)ai(\frac{1}{1-x^i})^{a_i}(1−xi1)ai现在已知了F(x)=∏i=1∞(11−xi)aiF(x)=\prod_{i=1}^{\in...原创 2019-01-09 16:59:57 · 310 阅读 · 0 评论