题目链接
对于一个区间【1,M】 求解有多少个数满足对于任意Ai都互质。
解题思路:我们先把整个A序列中的质因子保存下来,做线性处理即可。
#include<bits/stdc++.h>
#include<stdlib.h>
#include<algorithm>
#include<stdio.h>
#include<string.h>
#include<queue>
#include<time.h>
#include <cstdio>
#include <iostream>
#include <vector>
#define ll long long
#define int long long
#define inf 0x3f3f3f3f
#define mods 1000000007
#define modd 998244353
#define PI acos(-1)
#define fi first
#define se second
#define lowbit(x) (x&(-x))
#define mp make_pair
#define pb push_back
#define si size()
#define E exp(1.0)
#define fixed cout.setf(ios::fixed)
#define fixeds(x) setprecision(x)
#define IOS ios::sync_with_stdio(false);cin.tie(0)
using namespace std;
ll gcd(ll a,ll b){if(a<0)a=-a;if(b<0)b=-b;return b==0?a:gcd(b,a%b);}
template<typename T>void read(T &res){bool flag=false;char ch;while(!isdigit(ch=getchar()))(ch=='-')&&(flag=true);
for(res=ch-48;isdigit(ch=getchar());res=(res<<1)+(res<<3)+ch - 48);flag&&(res=-res);}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
ll qp(ll a,ll b,ll mod){ll ans=1;if(b==0){return ans%mod;}while(b){if(b%2==1){b--;ans=ans*a%mod;}a=a*a%mod;b=b/2;}return ans%mod;}//快速幂%
ll qpn(ll a,ll b, ll p){ll ans = 1;a%=p;while(b){if(b&1){ans = (ans*a)%p;--b;}a =(a*a)%p;b >>= 1;}return ans%p;}//逆元 (分子*qp(分母,mod-2,mod))%mod;
int prime[200000],minprime[200000];
void euler(int n) //欧拉筛
{
int c=0,i,j;
for(i=2; i<=n; i++)
{
if(!minprime[i])
prime[++c]=i,minprime[i]=i;
for(j=1; j<=c&&i*prime[j]<=n; j++)
{
minprime[i*prime[j]]=prime[j];
if(i%prime[j]==0)
break;
}
}
}
map<ll,ll>s;
ll vis[333333];
ll a[333333];
ll b[333333];
ll cnt=0;
signed main(){
euler(101000);
ll n,m;
read(n);
read(m);
for(int i=1;i<=n;i++){
read(a[i]);
if(a[i]==1)continue;
for(int j=1;;j++){
if(a[i]==1)break;
s[minprime[a[i]]]=1;
a[i]/=minprime[a[i]];
}
}
for(auto p:s){
for(int i=p.fi;i<=m;i=i+p.fi){
vis[i]=1;
}
}
for(int i=1;i<=m;i++){
if(!vis[i])b[++cnt]=i;
}
printf("%lld\n",cnt);
for(int i=1;i<=cnt;i++)
{
printf("%lld\n",b[i]);
}
}