NGM2  Another Game With Numbers
Little Chikoo likes to play with numbers. Often he plays the following game:
 He chooses a number N and a set of positive integers.
 He writes down all the numbers from 1 to N.
 He chooses the first number (say x) from the set and cancels out all the multiples of x from 1 to N, including x.
 He repeats step 3 for all the numbers from the set.
One day Little Chikoo was in a mood to play pranks. So his brother asked him to play the game with a certain challenge. He made the game a little harder and asked him to find out the number of integers which aren't cancelled after he completes step 4. If he does that then Little Chikoo gets to play on his brother's Nintendo for one full day. Now Little Chikoo is in a hurry and wants to finish the job as soon as possible. He has asked for your help.
Input
The first line of the input contains N and K. (N <= 10^9, K <= 15)
Then K numbers follow all in a single line. All numbers are <= 100.
Output
The output file must contain the number of integers thatÂ aren't cancelledÂ after he finishes step 4 of the game.
Example
Input: 10 3 2 4 5 Output: 4
(The numbers 1, 3, 7 and 9 weren't cancelled).
hide comments
Thomas:
20120612 08:37:45
Does Someone knows the formula?? 

Gunjit :
20120514 18:42:02
after running 23 test cases the judge says WA ... can any1 help me plz


accept:
20111209 10:26:15
can anybody help me about runtime error (SIGSEGV) 

sesume uchiha:
20110731 07:51:36
@paranoid : can u help me with the test case for which my code is failing (id 5453378) Last edit: 20110731 08:28:10 

anubhav gupta:
20110714 11:20:52
@paranoid please check solution id 5378282 its giving wa.dont know why 
Added by:  Paranoid Android 
Date:  20100309 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS OBJC PERL6 VB.NET 
Resource:   