#include<bits/stdc++.h>using namespace std;#define ll long long #define maxn 200int primes[maxn],m;bool vis[maxn];void init(){ for(int i=2;i<maxn;i++){ if(!vis[i]) primes[++m]=i; for(int j=1;j<=m;j++){ if(i*primes[j]>=maxn)break; vis[i* ......
本文摘自 :https://www.cnblogs.com/


