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<N<2^31,0<M<=10, and the M integer are non-negative and won’t exceed 20.

Output

  For each case, output the number.

Sample Input

12 2
2 3

Sample Output

7

AC:

#include<iostream>
#include<cstring>
#include<cstdio>
typedef long long ll;
using namespace std;

ll gcd(ll a,ll b)
{
    return b==0?a:gcd(b,a%b);
}

ll LCM(ll a,ll b)
{
    return a*b/gcd(a,b);
}

int main()
{
    ll n,a[21]={0};
    int m;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        for(int i=0;i<m;i++)
            scanf("%d",&a[i]);
        ll num=0;
        for(int i=1;i<=((1<<m)-1);i++)
        {
            ll ans=1,ant=0;
            for(int j=0;j<m;j++)
            {
                if(i&(1<<j))
                {
                    ans=LCM(ans,a[j]);
                    ant++;
                }
            }
            if((ant-1)%2)
                num-=(n/ans);
            else{
                num+=(n/ans);
            }
        }
        printf("%lld\n",n-num);
    }
    return 0;
}