HYSBZ 3512 (BZOJ 3512) DZY Loves Math IV

题目: 求${\sum }_{i=1}^n{\sum }_{j=1}^m\phi (i\ast j)$
解法:

1. 我们发现$n$很小 ,于是考虑枚举$i$, 于是对于每个$i$只需要求${\sum }_{j=1}^m\phi (i\ast j)$
2. 设$\omega$为$i$中所有不同的素因子的乘积,$\lambda$为$\frac{i}{\omega }$,于是问题只需要求$\lambda {\sum }_{j=1}^m\phi (\omega \ast j)$.
3. 设$S(\omega ,m)={\sum }_{j=1}^m\phi (\omega \ast j)$
4. $\to$$S(\omega ,m)={\sum }_{j=1}^m(\frac{\phi (\omega )}{\phi (gcd(\omega ,j))})\phi (j)gcd(\omega ,j)$
5. $\to$$S(\omega ,m)={\sum }_{j=1}^m\phi (\frac{\omega }{gcd(\omega ,j)})\phi (j)gcd(\omega ,j)$
6. $\to$$S(\omega ,m)={\sum }_{j=1}^m\phi (\frac{\omega }{gcd(\omega ,j)})\phi (j){\sum }_{d|gcd(\omega ,j)}\phi (d)$
7. $\to$$S(\omega ,m)={\sum }_{j=1}^m\phi (j){\sum }_{d|gcd(\omega ,j)}\phi (d)\phi (\frac{\omega }{gcd(\omega ,j)})$
8. $\to$$S(\omega ,m)={\sum }_{j=1}^m\phi (j){\sum }_{d|gcd(\omega ,j)}\phi (\frac{\omega }{d})$
9. $\to$$S(\omega ,m)={\sum }_{d|\omega }\phi (\frac{\omega }{d}){\sum }_{j=1}^{\lfloor \frac{m}{d}\rfloor }\phi (j\ast d)$
10. $\to$$S(\omega ,m)={\sum }_{d|\omega }\phi (\frac{\omega }{d})S(d,\lfloor \frac{m}{d}\rfloor )$
11. 当$\omega =1$时杜教筛求${\sum }_{i=1}^m\phi (i)$
12. $O(能过)$

代码:

 /**************************************************************
    Problem: 3512
    User: Ransln
    Language: C++
    Result: Accepted
    Time:6100 ms
    Memory:27852 kb
****************************************************************/
 
#include <bits/stdc++.h>
#define ll long long
using namespace std;
 
const int Max = 1e6 + 100;
const int MOD = 1e9 + 7;
int prime[Max], tot, phi[Max], sum[Max];
bool vis[Max];
void init(){
    phi[1] = 1;
    for(int i = 2; i < Max; i++){
        if(!vis[i])prime[tot ++] = i, phi[i] = i - 1;
        for(int j = 0; j < tot; j++){
            int tmp = i * prime[j];
            if(tmp >= Max)break;
            vis[tmp] = true;
            if(i % prime[j] == 0){
                phi[tmp] = phi[i] * prime[j];
                break;
            }
            phi[tmp] = phi[i] * (prime[j] - 1);
        }
    }
    for(int i = 1; i < Max; i++)sum[i] = (sum[i - 1] + phi[i]) % MOD;
}
vector<int> divide(ll x){
    vector<int> now;
    for(int i = 0; i < tot; i++){
        if(prime[i] * prime[i] > x)break;
        if(x % prime[i] == 0){
            now.push_back(prime[i]);
            while(x % prime[i] == 0)x /= prime[i];
        }
    }
    if(x != 1)now.push_back((int)x);
    return now;
}
map<ll, ll> Hash;
map<ll, ll> M;
ll solve(ll m){
    if(m < Max)return sum[m];
    if(Hash.count(m))return Hash[m];
    ll ans = 0;
    for(ll i = 2, j; i <= m; i = j + 1){
        j = m / (m / i);
        ans = (ans + (j - i + 1) * solve(m / i) % MOD) % MOD;
    }
    ans = (((((1 + m) * m) / 2) % MOD) - ans + MOD)% MOD;
    return Hash[m] = ans;
}
ll S(ll n, ll m){
    if(m == 1)return phi[n];
    if(n == 1)return solve(m);
    if(m == 0)return 0;
    if(M.count(n * (ll)1e10 + m))return M[n * (ll)1e10 + m];
    vector<int> p = divide(n);
    int len = p.size();
    ll ans = 0;
    for(int i = 0; i < (1 << len); i++){
        ll tmp = 1;
        for(int j = 0; j < len; j++){
            if(i >> j & 1)tmp = tmp * p[j];
        }
        ans = (ans + phi[n / tmp] * S(tmp, m / tmp)) % MOD;
    }
    return M[n * (ll)1e10 + m] = ans;
}
int main(){
    ll n, m;init();
    scanf("%lld%lld", &n, &m);
    ll ans = 0;
    for(int i = 1; i <= n; i++){
        vector<int> p = divide(i);
        int len = p.size(), x = 1;
        for(int j = 0; j < len; j++) x = x * p[j];
        ans = (ans + i / x * S(x, m)) % MOD;
    }
    printf("%lld\n", ans);
    return 0;
}