hdu 5212 code 容斥~或者莫比乌斯

最新推荐文章于 2017-10-02 20:15:41 发布

GDRetop

最新推荐文章于 2017-10-02 20:15:41 发布

阅读量645

点赞数

分类专栏： ##ACM-ICPC编程题 ##数学 ACM之数学问题文章标签：容斥膜拜乌斯反演数学莫比乌斯反演

本文链接：https://blog.csdn.net/firenet1/article/details/47174985

版权

##ACM-ICPC编程题同时被 3 个专栏收录

173 篇文章 0 订阅

订阅专栏

##数学

27 篇文章 0 订阅

订阅专栏

ACM之数学问题

11 篇文章 3 订阅

订阅专栏

Code

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 489 Accepted Submission(s): 191

Problem Description

WLD likes playing with codes.One day he is writing a function.Howerver,his computer breaks down because the function is too powerful.He is very sad.Can you help him?

The function:

int calc
{

  int res=0;

  for(int i=1;i<=n;i++)

    for(int j=1;j<=n;j++)

    {

      res+=gcd(a[i],a[j])*(gcd(a[i],a[j])-1);

      res%=10007;

    }

  return res;

}

Input

There are Multiple Cases.(At MOST

10 )

For each case:

The first line contains an integer

N(1≤N≤10000) .

The next line contains

N integers

a1,a2,...,aN(1≤ai≤10000) .

Output

For each case:

Print an integer,denoting what the function returns.

Sample Input

Sample Output

  
  
   
   64


   
   
    
    
     
     Hint
    
    gcd(x,y) means the greatest common divisor of x and y.

Source

BestCoder Round #39 ($)

这个博客写的很好啦。我就不写了

http://blog.csdn.net/lyhvoyage/article/details/45306211

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

int num[10001];
long long f[10001];
int main(){
    int n,u;
    while(scanf("%d",&n)!=EOF){
        memset(num,0,sizeof(num));
        for(int i = 0;i < n; i++){
            scanf("%d",&u);
            num[u]++;
        }
        long long ans = 0, mod = 10007;
        memset(f,0,sizeof(f));

        for(int i = 10000; i >= 1; i--){
            long long r = 0;
            for(int j = i; j <= 10000; j += i){
                r += f[j];
                f[i] += num[j];
            }
            f[i] = (f[i]*f[i] - r) % mod;
            ans += f[i]*i*(i-1) % mod;
        }
        cout<<ans % mod<<endl;
    }
    return 0;
}