Hdu1796 -- How many integers can you find)

Hdu1796 -- How many integers can you find)

How many integers can you find Time Limit:5000 MS Memory Limit:32768KB 64bit IO Format:% I64d & % I64uSubmit StatusAppoint description: System Crawler)

Description

Now you get a number N, and a M-integers set, you shoshould 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 Output

For each case, output the number.

Sample Input

 12 22 3 

Sample Output

 7 

Question: Give n and a set, number of m, and ask how many values can be positively divided by the number of m within 1 to n?

It can be understood that within 1 to n is the number of multiples of the number in m?

In the refresh principle, the binary number indicates that the I-th number is not obtained. If the odd number is obtained, the value is added. Returns the number of even numbers, minus

#include 
  
   #include 
   
    #include using namespace std ;#define LL long longLL a[12] ;LL n , m , k , i , j , cnt , num , ans ;LL gcd(LL x,LL y){    return x == 0 ? y : gcd(y%x,x) ;}int main(){    while(scanf("%lld %lld", &n, &m) != EOF)    {        ans = 0 ;        for(i = 0 ; i < m ; i++)        {            scanf("%lld", &a[i]) ;            if( a[i] == 0 )            {                i-- ;                m-- ;            }        }        cnt = 1 << m ;        for(i = 1 ; i < cnt ; i++)        {            k = 1 ;            num = 0 ;            for(j = 0 ; j < m ; j++)            {                if( 1<