$O(n)$的线性筛，你值得拥有。
```
#include<bits/stdc++.h>
using namespace std;
bool ret[100000010];
vector<int> p;
void ei(int n){
for (int i=2;i<=n;++i){
if (!ret[i]){
p.push_back(i);
}
for (int j=0;j<p.size();++j){
if (p[j]*i>n){
break;
}
ret[p[j]*i]=1;
if (i%p[j]==0){
break;
}
}
}
}
int main(){
std::ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
ei(n);
int sum=0,ans=0;
for (int i=0;i<p.size();++i){
sum+=p[i];
if (sum>n){
break;
}else{
ans+=1;
cout<<p[i]<<endl;
}
}
cout<<ans<<endl;
return 0;
}
```
@[ZZYX_18670145320](/user/1192648)
by ikun_god @ 2024-02-06 13:28:34
@[ikun_god](/user/996255) 谢谢
by ZZYX_18670145320 @ 2024-02-06 18:20:39