hdu1796(容斥)

  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

容斥模板题,注意输入的m个数不是整数是非负的

#include<iostream>
#include<cstdio>
using namespace std;
typedef long long ll;
int gcd(int a, int b)
{
    if(b==0)
        return a;
    else
        return gcd(b, a%b);
}
int main()
{
    int n, m;
    while(cin >> n >> m)
    {
        n--;
        int a[20];
        int res = 0;
        for(int i=0; i<m; i++)
        {
            int temp;
            cin >> temp;
            if(temp)
                a[i] = temp;
        }
        for(int i=1; i<(1<<m); i++)
        {
            int num = 0;
            for(int j=i; j!=0; j>>=1)
                num += (j & 1);
            //cout << i << "  " << num << ":";
            ll lcm = 1;
            for(int j=0; j<m; j++)
            {
                if(i >> j & 1)
                {
                    lcm = lcm / gcd(lcm, a[j]) * a[j];
                    if(lcm>n)
                        break;
                }
            }
            if(num % 2 == 0)
                res -= n / lcm;
            else
                res += n / lcm;
            //cout << res << endl;
        }
        cout << res << endl;
    }
    return 0;
}