HDU 1796 How many integers can you find(容斥原理)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1796

#include<cstdio>
#include<iostream>
#include<sstream>
#include<cstdlib>
#include<cstring>
#include<string>
#include<climits>
#include<cmath>
#include<algorithm>
#include<queue>
#include<vector>
#include<stack>
#include<set>
#include<map>
using namespace std;
int n,m,cnt;
long long ans,a[30];
long long gcd(long long a,long long b)
{
    long long temp;
    if(a<b)
    {
        temp=a;
        a=b;
        b=temp;
    }
    if(a%b==0)
        return b;
    else
        return gcd(b,a%b);
}
void DFS(int cur,long long lcm,int id)
{
    lcm=a[cur]/gcd(a[cur],lcm)*lcm;
    if(id%2==1)
        ans+=(n-1)/lcm;
    else
        ans-=(n-1)/lcm;
    for(int i=cur+1;i<cnt;i++)
        DFS(i,lcm,id+1);
}
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        cnt=0;
        int x;
        while(m--)
        {
            scanf("%d",&x);
            if(x!=0)
                a[cnt++]=x;
        }
        ans=0;
        for(int i=0;i<cnt;i++)
            DFS(i,a[i],1);
        printf("%d\n",ans);
    }
    return 0;
}