# HDU - 1796 How many integers can you find

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

AC代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
#define ll long long
ll a[30];
ll n,m;
ll ans;
int gcd(int a,ll b)
{
if(b==0)return a;
else return gcd(b,a%b);
}
void dfs(int p,int f,ll c)
{
c=a[p]*c/gcd(a[p],c);
if(f)
ans+=(n-1)/c;
else
ans-=(n-1)/c;
for(int i=p+1;i<m;i++)
dfs(i,!f,c);
}
int main()
{
while(scanf("%lld%lld",&n,&m)!=EOF)
{
for(int i=0;i<m;i++)
{
scanf("%lld",&a[i]);
}
sort(a,a+m);
ans=0;
for(int i=0;i<m;i++)
{
if(a[i]==0)continue;
dfs(i,1,a[i]);
}
printf("%lld\n",ans);
}
}



©️2019 CSDN 皮肤主题: 大白 设计师: CSDN官方博客