Cod sursa(job #2270323)
Utilizator | Data | 27 octombrie 2018 10:31:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int vm=1000001;
bool c[vm];
int main()
{
int n,i,j,nrprim=0;
fin>>n;
for(i=2;i<=n;++i)
if(!c[i])
{for(j=i*i;j<=n;j+=i)
c[j]=true;
nrprim++;
fout<<i<<endl;}
fout<<nrprim;
return 0;
}