ZOJ 2836 Number Puzzle

题目链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2836

题意：给出n个数，求在m范围内，能整除n个数中至少任意一个的数有多少个。

思路：容斥模板，注意枚举n个数的集合时要求一个最小公倍数。

#include <cstdio>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <stack>
#include <map>
#include <queue>
#include <utility>
using namespace std;

#define rep(i,j,k) for (int i=j;i<=k;i++)
#define Rrep(i,j,k) for (int i=j;i>=k;i--)

#define Clean(x,y) memset(x,y,sizeof(x))
#define LL long long
#define ULL unsigned long long
#define inf 0x7fffffff
#define mod %100000007


int n,m;
int num;
int fact[20];


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

int cal(int n , int m)
{
    int uplim = 1<<n;
    int ans = 0;
    rep(i,1,uplim-1)
    {
        int cnt = 1;
        int t = 0;
        rep(j,0,n-1)
            if ( i & (1<<j) )
            {
                t++;
                cnt = cnt/gcd( cnt , fact[j+1] )*fact[j+1];
            }
        if ( t & 1 ) ans += m/cnt;
        else ans -= m/cnt;
    }
    return ans;
}



int main()
{
    while(scanf("%d%d",&n,&m) == 2)
    {

        rep(i,1,n) scanf("%d",fact+i);
        printf("%d\n",cal(n,m));
    }
    return 0;
}