Cod sursa(job #1774253)
Utilizator | Data | 8 octombrie 2016 18:49:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int fr[2000000],n;
int main()
{
fin>>n;int k=1;
for(int i=3;i<=n;i=i+2)
if(fr[i]==0){k++;
for(int j=i;j<=n;j=j+i)
fr[j]=1;
}
fout<<k;
return 0;
}