How many integers can you find
Time Limit: 12000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3867 Accepted Submission(s): 1088
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
Output For each case, output the number.
Sample Input
12 2
2 3
Sample Output
7 题意：问在1~n-1这几个数，能被一个集合中的某个数整除的数的个数。
思路：容斥即可解决。‘
#include
#include
#include
#include
#include
#include
#include
using namespace std; typedef long long ll; int n,m; vector
num; int gcd(int a,int b){ if(b==0) return a; return gcd(b,a%b); } int Lcm(int a,int b){ return a/gcd(a,b)*b; } void solve(){ vector
dig; int ans = 0; for(int i = 1; i < (1<
|