容斥原理dfs

How many integers can you find

Time Limit: 12000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 9807    Accepted Submission(s): 2943

Problem 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

Author

wangye

 

Source

2008 “Insigma International Cup” Zhejiang Collegiate Programming Contest - Warm Up（4）

    题意：给定n和一个大小为m的集合，集合元素为非负整数，求1~n中能被集合里任意一个数整除的数的个数。

   思路:容斥原理的应用。先找出1-n中能被集合中任意一个数整除的数的个数，再减去能被集合中任意两个数整除的数的个数，即能被他们两个最小公倍数整除的数的个数···，奇加偶减

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<math.h>
#include<algorithm>
#include<stack>
using namespace std;
typedef long long ll;
int n,m,cnt;
ll ans,a[30];
ll gcd(ll a,ll b)
{
    if(b==0)
        return a;
    return gcd(b,a%b);
}
void dfs(int cur,ll lcm,int id)
{
    lcm=a[cur]/gcd(a[cur],lcm)*lcm;
    if(id&1)
        ans+=(n-1)/lcm;//因为此题并不包括n本身
    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)
                a[cnt++]=x;
        }
        ans=0;
        for(int i=0;i<cnt;i++)
            dfs(i,a[i],1);
        cout<<ans<<endl;
    }
}