SPOJ5971 LCMSUM（反演+欧拉函数性质+积性函数(线性)筛）

传送门

---

题目大意

求${\sum }_{i=1}^{n}lcm(i,n)$

反演

根据常见套路，首先我们化成含$gcd$的式子：${\sum }_{i=1}^n\frac{i\ast n}{gcd(i,n)}$

然后枚举$gcd(i,n)$，得到$n{\sum }_{i=1}^n{\sum }_{d=1,d|n}^n\frac{i}{d}[gcd(i,n)=d]$

再根据$[gcd(\frac{i}{d},\frac{n}{d})=1]\iff [gcd(i,n)=d]$

令$i=x\ast d$，枚举$x\in [1,n]$，代入$i$后刚好消去了$\frac{1}{i}$，得到$n{\sum }_{d|n}{\sum }_{x=1}^{\lfloor \frac{n}{d}\rfloor }x\ast [gcd(x,\lfloor \frac{n}{d}\rfloor )=1]$

欧拉函数性质

${\sum }_{x=1}^{\lfloor \frac{n}{d}\rfloor }x\ast [gcd(x,\lfloor \frac{n}{d}\rfloor )=1]$即小于$\lfloor \frac{n}{d}\rfloor$且与$\lfloor \frac{n}{d}\rfloor$互质的数之和

${\sum }_{i=1}^{n}i\ast [gcd(i,n)=1]=\{\begin{array}{rcl}1& & n=1\\ \frac{\phi (n)n}{2}& & n\ge 2\end{array}$

证明：

• 当 $n=1$时显然为$1$
• 当$n\ge 2$时，$\phi (n)$总为偶数，因为和$n$互质的数总是成对出现，假设$n$和$i$互质，那么$n-i$和$i$也互质，他们的和为$n$，并且有$\phi (n)$对，那么答案就是$\frac{\phi (n)n}{2}$

那么最后的答案显然是$n(n+{\sum }_{d\ge 2,d|n}\frac{\phi (d)d}{2})$，这里的$d$取遍$n$的所有因数时实际上和$\lfloor \frac{n}{d}\rfloor$等价

考虑完上述性质，我们就可以得到类似埃氏筛预处理的代码了：

时间复杂度$O(nloglogn)$

//
// Created by Happig on 2020/9/28
//
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>

using namespace std;
#define fi first
#define se second
#define pb push_back
#define ins insert
#define Vector Point
#define ENDL "\n"
#define lowbit(x) (x&(-x))
#define mkp(x, y) make_pair(x,y)
#define mem(a, x) memset(a,x,sizeof a);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const double eps = 1e-8;
const double pi = acos(-1.0);
const int inf = 0x3f3f3f3f;
const double dinf = 1e300;
const ll INF = 1e18;
const int Mod = 1e9 + 7;
const int maxn = 1e6 + 10;

vector<int> prime;
bitset<maxn> vis;
ll phi[maxn], sum[maxn];

void init() {
    phi[1] = 1;
    for (int i = 2; i < maxn; i++) {
        if (!vis[i]) {
            prime.push_back(i);
            phi[i] = i - 1;
        }
        for (int j = 0; j < prime.size() && i * prime[j] < maxn; j++) {
            vis[i * prime[j]] = 1;
            if (i % prime[j]) {
                phi[i * prime[j]] = phi[i] * phi[prime[j]];
            } else {
                phi[i * prime[j]] = phi[i] * prime[j];
                break;
            }
        }
    }
    sum[1] = 1;
    for (int i = 2; i < maxn; i++) {
        sum[i]++;
        for (int j = i; j < maxn; j += i) {
            sum[j] += phi[i] * i / 2;
        }
    }
}

int main() {
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t, n;
    init();
    cin >> t;
    while (t--) {
        cin >> n;
        cout << sum[n] * n << ENDL;
    }
    return 0;
}

线性筛再优化

显然上述代码不够优秀，因为根据狄利克雷卷积不难知道$f=id\ast \phi$，$f(n)={\sum }_{d|n}\phi (d)d$是积性函数，那么肯定是可以线性筛的，这里参考了$OI-wiki$上的讲解，十分感谢！

• 首先考虑$f(p),p\in primes$，易得$f(p)=p(p-1)+1$

• 然后考虑$f(p^k)$，那么有$f(p^k)={\sum }_{i=0}^k{p}^i\ast \phi (p^i)$
  根据欧拉函数的性质：对于素数$p$，若$n\%i==0$，那么$\phi (pn)=p\ast \phi (n)$
  那么就有$f(p^k)={\sum }_{i=0}^k{p}^{2k-1}(p-1)$
  同理得$f(p^{k+1})=f(p^k)+p^{2k+1}(p-1)$

• 对于线性筛中$p\nmid i$的情况，显然为$f[i\ast p]=f[i]\ast f[p]$

• 对于线性筛中$p|i$的情况，令$i=x\ast p^c,gcd(x,p^c)=1$，可得$f[i\ast p]=f[x]\ast f[p^{c+1}]①$
  然后又根据$f[i]=f[x]\ast f[p^c]②$，$①-②$有：
  $f[i\ast p]-f[i]=f[x]\ast p^{2c+1}(p-1)③$，那么同理可得：
  $f[i]-f[i/p]=f[x]\ast p^{2c-1}(p-1)④$，联立$③,④$最终得到：
  $f[i\ast p]=f[i]+(f[i]-f[i/p])\ast p^2$

时间复杂度为$O(n)$

//
// Created by Happig on 2020/9/28
//
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>

using namespace std;
#define fi first
#define se second
#define pb push_back
#define ins insert
#define Vector Point
#define ENDL "\n"
#define lowbit(x) (x&(-x))
#define mkp(x, y) make_pair(x,y)
#define mem(a, x) memset(a,x,sizeof a);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const double eps = 1e-8;
const double pi = acos(-1.0);
const int inf = 0x3f3f3f3f;
const double dinf = 1e300;
const ll INF = 1e18;
const int Mod = 1e9 + 7;
const int maxn = 1e6 + 10;

vector<int> prime;
bitset<maxn> vis;
ll f[maxn];

void init() {
    f[1] = 1;
    for (int i = 2; i < maxn; i++) {
        if (!vis[i]) {
            prime.push_back(i);
            f[i] = 1LL * i * i - i + 1;
        }
        for (int j = 0; j < prime.size() && i * prime[j] < maxn; j++) {
            vis[i * prime[j]] = 1;
            if (i % prime[j]) {
                f[i * prime[j]] = f[i] * f[prime[j]];
            } else {
                f[i * prime[j]] = f[i] + (f[i] - f[i / prime[j]]) * prime[j] * prime[j];
                break;
            }
        }
    }
}

int main() {
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t, n;
    init();
    cin >> t;
    while (t--) {
        cin >> n;
        cout << (f[n] + 1) * n / 2 << ENDL;
    }
    return 0;
}