Cod sursa(job #2257535)
Utilizator | Data | 10 octombrie 2018 10:15:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
int main()
{
int n,pr=0,prim[2000000]={1};
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
fin.close();
for(int i=2;i<=n;i++)
if(prim[i]==1)
{
pr++;
for(int j=2*i;j<=n;j=j+i)
prim[j]=0;
}
fout<<pr;
fout.close();
return 0;
}