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

题意：

      求1->n-1之间能被一个集合A内元素整除的数的个数，例如n = 12, A = {2, 3} 则能被A集合元素整除的数的集合为{2,  3, 4 , 6, 8, 9, 10}则结果为7。

解法：容斥定理，用回溯算法。

让我没想到的是用深搜来解决多重for循环问题

Description

  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 
       
       

 

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<math.h>
using namespace std;
long long a[20];
long long n,m;
long long ans;
long long gcd(long long a,long long b)
{
    return b==0?a:gcd(b,a%b);
}
void dfs(int c,int flag,long long lcm)
{
    lcm=a[c]/gcd(a[c],lcm)*lcm;
    if(flag) ans+=(n-1)/lcm;
    else
        ans-=(n-1)/lcm;
    for(int i=c+1; i<m; i++)
        dfs(i,!flag,lcm);
}
int main()
{
    while(~scanf("%lld %lld",&n,&m))
    {
        ans=0;
        for(int i=0; i<m; i++)
        {
            scanf("%lld",&a[i]);
            if(a[i]==0)
            {
                i--;
                m--;
            }
        }
        for(int i=0; i<m; i++)
            dfs(i,1,a[i]);
        printf("%lld\n",ans);

    }
    return 0;
}