hdu 1796 容斥定理

 How many integers can you find 

Now you get a number N, and a M-integers set, you should find out how many integers which are small than N, that they can divided exactly by any integers in the set. For example, N=12, and M-integer set is {2,3}, so there is another set {2,3,4,6,8,9,10}, all the integers of the set can be divided exactly by 2 or 3. As a result, you just output the number 7.
Input
There are a lot of cases. For each case, the first line contains two integers N and M. The follow line contains the M integers, and all of them are different from each other. 0

#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
const int MAXN = 15;
typedef long long LL;
int a[MAXN];
int ans;
int n, m, cnt;
int gcd(LL a, LL b)
{
    return a%b==0?b:gcd(b, a%b);
}
void dfs(int id, int lcm, int cur)
{
    int Lcm = a[cur]/gcd(a[cur], lcm)*lcm;
    if(id&1)
        ans+=(n-1)/Lcm;
    else
        ans-=(n-1)/Lcm;
    for(int i=cur+1;i<cnt;++i)
        dfs(id+1,Lcm,i);
}
int main()
{
    while(~scanf("%d %d", &n, &m))
    {
        cnt=0;
        ans=0;
        int x;
        for(int i=0;i<m;++i)
        {
           scanf("%d", &x);
           if(x!=0)
            a[cnt++]=x;
        }
        for(int i=0;i<cnt;++i)
            dfs(1,a[i],i);
        printf("%d\n", ans);
    }
    return 0;
}

法二(用二进制来代表每一个数是否被使用)

#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
const int MAXN = 15;
typedef long long LL;
int a[MAXN];
int ans;
int n, m, cnt;
int gcd(LL a, LL b)
{
    return a%b==0?b:gcd(b, a%b);
}
int main()
{
    while(~scanf("%d %d", &n, &m))
    {
        cnt=0;
        ans=0;
        int x;
        for(int i=0;i<m;++i)
        {
           scanf("%d", &x);
           if(x!=0)
            a[cnt++]=x;
        }
        for(int i=1;i<1<<cnt;++i)
        {
            int lcm=1, id=0;
            for(int j=0;j<cnt;++j)
            {

                if(1<<j&i)
                {
                    id++;
                    lcm=a[j]/gcd(lcm, a[j])*lcm;
                }
            }
            if(id&1)
                ans+=(n-1)/lcm;
            else
                ans-=(n-1)/lcm;
        }
        printf("%d\n", ans);
    }
    return 0;
}