洛谷P2150
SOL
-
两两互质:对于同一个质因数的倍数不能选在同一集合内。
-
状压 A , B A,B A,B所选的集合的质因数情况。即为 f [ S 1 ] [ S 2 ] f[S_1][S_2] f[S1][S2]。预处理出每一个数包含的质因数,也是状压。枚举当前数选在 A或B或不选。
-
{ f [ i ] [ S 1 ∣ k ] [ S 2 ] + = f [ i − 1 ] [ S 1 ] [ S 2 ] f [ i ] [ S 1 ] [ S 2 ∣ k ] + = f [ i − 1 ] [ S 1 ] [ S 2 ] \begin{cases} f[i][S_1|k][S_2]+=f[i-1][S_1][S_2] \\ \\ f[i][S_1][S_2|k]+=f[i-1][S_1][S_2] \\ \end{cases} ⎩⎪⎨⎪⎧f[i][S1∣k][S2]+=f[i−1][S1][S2]f[i][S1][S2∣k]+=f[i−1][S1][S2]
-
对于 n ≥ 30 n\ \ge\ 30 n ≥ 30的点,可以发现 ∀ i , i at most contain 1 prime that is bigger than 22 \forall\ i,\text{i at most contain 1 prime that is bigger than 22} ∀ i,i at most contain 1 prime that is bigger than 22,按照大于等于 23 23 23的质因数给原数列分组即可。在一个组内只能选在一边。
CODE
#include<bits/stdc++.h>
using namespace std;
#define sf scanf
#define pf printf
#define ll long long
#define cs const
#define db double
#define ri register int
#define gc getchar()
#define in red()
#define REP for(ri i=0;i<=sta;++i)for(ri j=0;j<=sta;++j)
inline int red(){
int num=0,f=1;char c=gc;
for(;!isdigit(c);c=gc)if(c=='-')f=-1;
for(;isdigit(c);c=gc)num=(num<<1)+(num<<3)+(c^48);
return num*f;
}
cs int N=1e3+10,lim=500,size=1<<8;
ll mod;
inline void Add(ll &a,cs ll &b){a= a+b>=mod ?a-mod+b : a+b;}
inline int add(cs ll &a,cs ll &b){return a+b>=mod ? a-mod+b : a+b;}
inline int dec(cs ll &a,cs ll &b){return a-b<0 ? a+mod-b : a-b;}
int p[N],top=0,vis[N],n,st[N];
ll f[2][size][size],f1[2][size][size],f2[2][size][size];
vector<int> h[N];
inline void init(){
for(ri i=2;i<=lim;++i){
if(!vis[i])p[++top]=i;
for(ri j=1;j<=top;++j){
if(i*p[j]>lim)break;
vis[i*p[j]]=1;
if(i%p[j]==0)break;
}
}
p[++top]=1;
for(ri i=2;i<=n;++i){
for(ri j=1;j<=8;++j){
if(i>=p[j]&&i%p[j]==0)st[i]|=(1<<(j-1));
}
for(ri j=9;j<=top;++j){
if(i>=p[j]&&i%p[j]==0){
h[j].push_back(i);
break;
}
}
}
}
signed main(){
// freopen("data.in","r",stdin);
n=in;mod=in;
init();
f[0][0][0]=1;
int op=0;
int sta=(1<<8)-1;
for(ri o=h[top].size()-1;o>=0;--o){
int k=h[top][o];
REP {f[op^1][i][j]=f[op][i][j];}
REP{
if(!(j&st[k]))Add(f[op^1][i|st[k]][j],f[op][i][j]);
if(!(i&st[k]))Add(f[op^1][i][j|st[k]],f[op][i][j]);
}
op^=1;
}
for(ri t=9;t<top;++t){
memcpy(f1,f,sizeof(f));
memcpy(f2,f,sizeof(f));
int pre=op;
for(ri o=h[t].size()-1;o>=0;--o){
int k=h[t][o];
REP {f1[op^1][i][j]=f1[op][i][j];f2[op^1][i][j]=f2[op][i][j];}
REP{
if(!(j&st[k]))Add(f1[op^1][i|st[k]][j],f1[op][i][j]);
if(!(i&st[k]))Add(f2[op^1][i][j|st[k]],f2[op][i][j]);
}
op^=1;
}
REP{
f[op][i][j]=dec(add(f1[op][i][j],f2[op][i][j]),f[pre][i][j]);
}
}
ll ans=0;
REP Add(ans,f[op][i][j]);
cout<<ans<<'\n';
return 0;
}