LOI_Sherlock

#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int maxn=10001;int n,tot;int prime[maxn];bool vis[maxn];void find_prime(int n){ for(int i=2

#include<iostream>#include<cstdio>#include<cmath>using namespace std;int n;bool prime[10001];void shai(int s){ for(int i=2;i<=s/2;i++) for(int j=i*i;j<=s;j+=i) prime[j]=1;}int main