洛陽杯[數論][線性篩]

  分析 (https://blog.csdn.net/forever_dreams/article/details/83450135) #include<bits/stdc++.h> #define N 100005 using namespace std; int n,m,a[N],isp[N],prim[N],tot; int g[N],ans; bitset<1000000000> S;

>>阅读原文<<