容斥水题,,但是自己没见过,赛后学了学
结果=1个数最小公倍数的个数(小于n,后面的都小于n) - 2个数最小公倍数的个数+3个数最小公倍数的个数 直到n;
#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include <map>
#include <queue>
#define mod 31536000
#define INF 0x3f3f3f3f
#define fuck() (cout << "----------------------------------------" << endl)
using namespace std;
const int maxn = 100000 + 10;
int m,cnt;
long long n, ans;
long long arr[15];
long long gcd(long long a, long long b)
{
return b==0?a:gcd(b,a%b);
}
long long lcm(long long a, long long b)
{
return a*b/gcd(a,b);
}
void dfs(int i,long long sum,int step)
{
if(step > cnt)
return ;
long long l = lcm(arr[i],sum);
if(step % 2 == 1)
ans += (n-1)/l;
else
ans -= (n-1)/l;
for(int j=i+1; j<cnt; j++)
dfs(j,l,step+1);
}
int main()
{
while(scanf("%lld%d",&n,&m) == 2 && n)
{
cnt = 0;
for(int i=0; i<m; i++)
{
long long x;
scanf("%lld",&x);
if(x!=0)
arr[cnt++] = x;
}
ans = 0;
for(int i=0; i<cnt; i++)
dfs(i,arr[i],1);
printf("%lld\n",ans);
}
}
还有一个方法是二进制枚举子集,m<10;所以一共就2的十次方,判断数的二进制有几个1,并求出这些数的lcm
#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include <map>
#include <queue>
#define mod 31536000
#define INF 0x3f3f3f3f
#define fuck() (cout << "----------------------------------------" << endl)
using namespace std;
const int maxn = 100000 + 10;
int m,cnt;
long long n, ans;
long long arr[15];
long long gcd(long long a, long long b)
{
return b==0?a:gcd(b,a%b);
}
long long lcm(long long a, long long b)
{
return a*b/gcd(a,b);
}
int main()
{
while(scanf("%lld%d",&n,&m) == 2 && n)
{
cnt = 0;
for(int i=0; i<m; i++)
{
long long x;
scanf("%lld",&x);
if(x!=0)
arr[cnt++] = x;
}
ans = 0;
for(int i=1; i<(1<<cnt); i++)
{
int k=0;
long long l = 1;
for(int j=0; j<cnt; j++)
{
if(i&(1<<j))
{
k++;
l = lcm(l,arr[j]);
}
}
if(k%2 == 1)
ans += (n-1)/l;
else
ans -= (n-1)/l;
}
printf("%lld\n",ans);
}
}