欧拉筛模板

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl "\n"

const ll N = 1e6+7;
ll su[N],now=0;
bool vis[N];

void solve(){
	//欧拉筛 
	for(ll i = 2 ; i <= 10000 ; i ++){
		if(!vis[i])
			su[now++]=i;
		for(ll j = 0 ; su[j]*i <= 10000 ; j ++){
			vis[su[j]*i]=1;
			if(i%su[j] == 0)break;
		}
	}
	return;
}

int main(){
	ll t=1;//cin >> t;
	while(t--)solve();
	return 0;
}