emmmm…..不如欧拉筛强劲
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<deque>
#include<queue>
#define LL long long
const int inf = 10000000 + 10;
const int size = 100010;
using namespace std;
bool vis[size];
int n;
int main()
{
cin>>n;
vis[1]=1;
for(int i=2;i<=sqrt(n);++i)
if(!vis[i])
for(int j=i*i;j<=n;j+=i)
vis[j]=1;
// int ans=0;
for(int i=2;i<=n;++i)
if(vis[i]==0) //是0的就是质数
// ans++;
// cout<<ans;
return 0;
}