• Mobius反演的套路


    T1

    (sum_{i=1}^N sum_{j=1}^M [(i,j)=1])

    (f(d)=sum_{i=1}^N sum_{j=1}^M [(i,j)=d])

    (g(d)=sum_{i=1}^N sum_{i=1}^M [d|(i,j)]=lfloor frac{N}{d} floor lfloor frac{M}{d} floor)

    (g(n)=sum_{n|d} f(d))

    (f(n)=sum_{n|d} mu(frac{d}{n})g(d))

    (f(1)=sum_{i=1}^{min(N,M)} mu(i)lfloor frac{N}{i} floor lfloor frac{M}{i} floor)

    T2

    (sum_{i=1}^N sum_{j=1}^M (i,j))

    (f(d)=sum_{i=1}^N sum_{j=1}^M d[(i,j)=d]=sum_{i=1}^{lfloor frac{min(N,M)}{d} floor} dmu(i) lfloor frac{N}{id} floor lfloor frac{M}{id} floor)

    (Ans=sum_{d=1}^{min(N,M)} f(d)=sum_{d=1}^{min(N,M)} sum_{i=1}^{lfloor frac{min(N,M)}{d} floor} dmu(i) lfloor frac{N}{id} floor lfloor frac{M}{id} floor)

    (w=id)

    (Ans=sum_{w=1}^{min(N,M)} sum_{d|w} dmu(frac{w}{d}) lfloor frac{N}{w} floor lfloor frac{M}{w} floor)

    (sum_{d|w} dmu(frac{w}{d})=phi(w))显然是积性函数,线性筛后做下前缀和,离线(Theta(min(N,M)))

    (sum_{w=1}^{min(N,M)} lfloor frac{N}{w} floor lfloor frac{M}{w} floor) 整除分块可以做到在线(Theta(sqrt{N}+sqrt{M}))

    多组询问下总复杂度(Theta(min(N,M)+T(sqrt{N}+sqrt{M})))

    T3

    (sum_{i=1}^N sum_{j=1}^M frac{ij}{(i,j)})

    (f(d)=sum_{i=1}^{lfloor frac{N}{d} floor} sum_{j=1}^{lfloor frac{M}{d} floor} ijd[(i,j)=1]=d sum_{i=1}^{lfloor frac{N}{d} floor} sum_{j=1}^{lfloor frac{M}{d} floor} ij[(i,j)=1])

    (Ans=sum_{d=1}^{min(N,M)} f(d))

    (Ans=sum_{d=1}^{min(N,M)} d sum_{i=1}^{lfloor frac{N}{d} floor} sum_{j=1}^{lfloor frac{M}{d} floor} ijsum_{n|(i,j)} mu(n))

    (Ans=sum_{d=1}^{min(N,M)} d sum_{n=1}^{lfloor frac{min(N,M)}{d} floor} n (sum_{i=1}^{lfloor frac{N}{dn} floor} i)n(sum_{j=1}^{lfloor frac{M}{dn} floor} j)mu(n))

    (w=dn)

    (Ans=sum_{w=1}^{min(N,M)} (sum_{i=1}^{lfloor frac{N}{w} floor} i)(sum_{j=1}^{lfloor frac{M}{w} floor} j) wsum_{n|w} n mu(n))

    线筛前缀和+整除分块

    复杂度与上题相同

    T4

    (sum_{i=1}^N sum_{j=1}^M d(ij))

    (sum_{i=1}^N sum_{j=1}^M sum_{a|i} sum_{b|j} [(a,b)=1])

    $sum_{i=1}^N sum_{j=1}^M lfloor frac{N}{i} floor lfloor frac{M}{j} floor[(i,j)=1] $

    (w=(i,j))

    (sum_{w=1}^{min(N,M)} mu(w) sum_{i=1}^{lfloor frac{N}{w} floor} sum_{j=1}^{lfloor frac{M}{w} floor} lfloor frac{N}{iw} floor lfloor frac{M}{jw} floor)

    整除分块+线筛前缀和

    复杂度仍然与上题相同

  • 相关阅读:
    npx小工具
    2015 Multi-University Training Contest 1
    字符串 --- KMP Eentend-Kmp 自动机 trie图 trie树 后缀树 后缀数组
    AC自动机
    AC自动机
    区间合并 --- Codeforces 558D : Gess Your Way Out ! II
    暴力 + 贪心 --- Codeforces 558C : Amr and Chemistry
    计数排序 + 线段树优化 --- Codeforces 558E : A Simple Task
    Ubuntu 16.04 安装mysql并设置远程访问
    数学 --- 高斯消元 POJ 1830
  • 原文地址:https://www.cnblogs.com/AH2002/p/10029079.html
Copyright © 2020-2023  润新知