JZOJ4991. Skyfall

题目大意

给定$A,B,C$，计算

$$\sum_{i=1}^A\sum_{j=1}^B\sum_{k=1}^C~d(i\times j\times k)$$
其中 $d(x)$表示 $x$的因子个数。

Data Constraint
$A,B,C\leq5000$

题解

先讲一个结论

$$\sum_{i=1}^A\sum_{j=1}^B\sum_{k=1}^C~d(i\times j\times k)$$
等价于
$$\sum_{(i,j)=1~and~(j,k)=1~and~(i,k)=1}\lfloor\frac{A}{i}\rfloor\lfloor\frac{B}{j}\rfloor\lfloor\frac{C}{k}\rfloor$$
整理一下
$$\sum_{i=1}^A\sum_{j=1}^B\sum_{k=1}^C[(i,j)=1][(j,k)=1][(i,k)=1]\lfloor\frac{A}{i}\rfloor\lfloor\frac{B}{j}\rfloor\lfloor\frac{C}{k}\rfloor$$
$$\sum_{i=1}^A\lfloor\frac{A}{i}\rfloor\sum_{j=1}^B\sum_{k=1}^C[(i,j)=1][(j,k)=1][(i,k)=1]\lfloor\frac{B}{j}\rfloor\lfloor\frac{C}{k}\rfloor$$
莫比乌斯反演一下
$$\sum_{i=1}^A\lfloor\frac{A}{i}\rfloor\sum_{d=1}^{min(B,C)}[(i,d)=1]\mu(d)\sum_{j'=1}^{\lfloor\frac{B}{d}\rfloor}\sum_{k'=1}^{\lfloor\frac{C}{d}\rfloor}[(j',i)=1][(k',i)=1]\lfloor\frac{B}{j'd}\rfloor\lfloor\frac{C}{k'd}\rfloor$$

然后就可以计算了，加一个记忆化来优化常数。

时间复杂度：$O(n^2logn)$

SRC

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std ;

#define M 5000 + 10
typedef long long ll ;
const int MO = 1 << 30 ;

bool flag[M] ;
int Pri[M] , Miu[M] , Rec[M] , G[M][M] ;
int A , B , C ;
ll ans ;

void Pre() {
    Miu[1] = 1 ;
    for (int i = 2 ; i <= 5000 ; i ++ ) {
        if ( !flag[i] ) {
            Pri[++Pri[0]] = i ;
            Miu[i] = -1 ;
        }
        for (int j = 1 ; j <= Pri[0] ; j ++ ) {
            if ( i * Pri[j] > M ) break ;
            flag[i*Pri[j]] = 1 ;
            if ( i % Pri[j] == 0 ) { Miu[i*Pri[j]] = 0 ; break ; }
            Miu[i*Pri[j]] = - Miu[i] ;
        }
    }
}

int gcd( int x , int y ) {
    if ( G[x][y] ) return G[x][y] ;
    return G[x][y] = !y ? x : gcd( y , x % y ) ;
}

int Calc( int x ) {
    if ( Rec[x] >= 0 ) return Rec[x] ;
    Rec[x] = 0 ;
    for (int i = 1 ; i <= x ; i ++ ) {
        if ( !flag[i] ) continue ;
        Rec[x] = (Rec[x] + x / i) % MO ;
    }
    return Rec[x] ;
}

int main() {
    freopen( "skyfall.in" , "r" , stdin ) ;
    freopen( "skyfall.out" , "w" , stdout ) ;
    Pre() ;
    scanf( "%d%d%d" , &A , &B , &C ) ;
    for (int i = 1 ; i <= A ; i ++ ) {
        for (int j = 1 ; j <= max( B , C ) ; j ++ ) {
            flag[j] = gcd( i , j ) == 1 ? 1 : 0 ;
            Rec[j] = -1 ;
        }
        for (int d = 1 ; d <= min( B , C ) ; d ++ ) {
            if ( !flag[d] ) continue ;
            ans = (ans + (ll)A / i * Miu[d] % MO * Calc( B / d ) % MO * Calc( C / d ) % MO ) % MO ;
        }
    }
    printf( "%lld\n" , (ans + MO) % MO ) ;
    return 0 ;
}

以上.