用欧拉筛交了n次，一直RE

#include<bits/stdc++.h>
using namespace std;
const int N=100000001;
int n; 
bool flag[N];
int pri[N],pn;
int main(){
    cin>>n;
    for(int i=2;i<=n;i++){
        if(flag[i]==0) pri[++pn]=i;
        for(int j=1;j<=pn&&j*pri[i]<=n;j++){
            flag[i*pri[j]]=1;
            if(i%pri[j]==0) break;
        }
    }
    for(int i=1;i<=pn;i++) cout<<pri[i]<<endl;
    return 0;
}