这因该不比欧拉筛法慢太多吧

#include<bits/stdc++.h>
using namespace std;
int n, cnt, sum;
int prime[10005];

bool isprime(int num) {
	for(int i = 0; i < cnt; i++) {
		if(num % prime[i] == 0) return false;
	}
	return true;
}

int main() {
	cin>> n;
	for(int i = 2; i <= n; i++) {
		if(isprime(i)) {
			prime[cnt++] = i;
			sum += i;
		}
	} 
	for(int i = 0; i < cnt; i++) cout<< prime[i] << " ";
	return 0;
}






/*
______      ______  __  __      ______   _____   ______
/\__  _\    /\  _  \/\ \/\ \    /\__  _\ /\  __ \/\__  _\
\/_/\ \/    \ \ \ \ \ \ \/ /    \/_/\ \/ \ \ \/\ \/_/\ \/
   \ \ \     \ \  __ \ \   <       \ \ \  \ \ \ \ \ \ \ \
    \_\ \__   \ \ \/\ \ \ \\ \      \_\ \__\ \ \_\ \ \_\ \__
    /\_____\   \ \_\ \_\ \_\ \_\    /\_____\\ \_____\/\_____\
    \/_____/    \/_/\/_/\/_/\/_/    \/_____/ \/_____/\/_____/

*/