CodeForces 235E

最新推荐文章于 2020-12-18 20:02:59 发布

After0514

最新推荐文章于 2020-12-18 20:02:59 发布

阅读量469

点赞数

分类专栏：数学

本文链接：https://blog.csdn.net/wen_xp/article/details/53236342

版权

数学专栏收录该内容

29 篇文章 0 订阅

订阅专栏

http://blog.csdn.net/tc_to_top/article/details/48014357

\sum i = 1 a \sum j = 1 b \sum k = 1 c d (i * j * k) = \sum g c d (i, j) = 1, g c d (i, k) = 1, g c d (k, j) = 1 ⌊ a i ⌋ ⌊ b j ⌋ ⌊ c k ⌋ = \sum a ⌊ a i ⌋ \sum g c d (i, j) = 1 b ⌊ b j ⌋ \sum g c d (i, k) = 1 c ⌊ c k ⌋ * g c d (k, j) = = 1 g c d (k, j) = = 1 = \sum d | k, d | j m i n (b, c) μ [d]

$\begin{equation*} \sum_{i=1}^a\sum_{j=1}^b\sum_{k=1}^cd(i*j*k)= \sum_{gcd(i,j)=1,gcd(i,k)=1,gcd(k,j)=1} \biggl\lfloor\frac{a}{i}\biggr\rfloor \biggl\lfloor\frac{b}{j}\biggr\rfloor \biggl\lfloor\frac{c}{k}\biggr\rfloor= \\ \sum^a\biggl\lfloor\frac{a}{i}\biggr\rfloor \sum_{gcd(i,j)=1}^b\biggl\lfloor\frac{b}{j}\biggr\rfloor \sum_{gcd(i,k)=1}^c\biggl\lfloor\frac{c}{k}\biggr\rfloor *gcd(k,j)==1 \\ gcd(k,j)==1= \sum_{d|k,d|j}^{min(b,c)}\mu[d] \end{equation*}$

#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
using namespace std;
const int N=2200;
const int mod=1<<30;

int vis[N],pri[N],pn,mu[N],mp[N][N];
typedef __int64 LL;

void init(){
    memset(vis,0,sizeof(vis));
    int n=2000;
    pn=0;
    mu[1]=1;
    for(int i=2;i<=n;i++){
        if(vis[i]==0){
            pri[pn++]=i;
            mu[i]=-1;
        }
        for(int j=0;j<pn;j++){
            if(pri[j]*i>n)break;
            vis[pri[j]*i]=1;
            if(i%pri[j]==0){
                mu[pri[j]*i]=0;
                break;
            }
            else {
                mu[pri[j]*i]=-mu[i];
            }
        }
    }
}

int gcd(int i,int j){
    if(mp[i][j]!=-1)return mp[i][j];
    if(i==0)return j;
    return mp[i][j]=gcd(j%i,i);
}

LL cal(int a,int b){
    LL ans=0;
    for(int i=1;i<=a;i++)if(gcd(i,b)==1){
        ans+=a/i;
    }
    //printf("%d %d %I64d\n",a,b,ans);
    return ans;
}

void prin(int aa[N],int n){
    for(int i=0;i<n;i++){
        printf("%d%c",aa[i],i==n-1?'\n':' ');
    }
}
int main(){
    #ifdef DouBi
    freopen("in.cpp","r",stdin);
    #endif // DouBi
    int a,b,c;
    init();
    //prin(mu,10);

    memset(mp,-1,sizeof(mp));
    while(scanf("%d%d%d",&a,&b,&c)!=EOF){
        LL ans=0;

        for(int i=1;i<=a;i++){
            for(int j=1;j<=min(b,c);j++)if(gcd(i,j)==1){
                ans+=((LL)mu[j]*cal(b/j,i)*cal(c/j,i)*(a/i));
                ans=(ans+mod)%mod;
            }
        }
        printf("%I64d\n",ans);
    }
    return 0;
}