Cod sursa(job #2360355)
Utilizator | Data | 1 martie 2019 18:49:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int fr[20000005];
int main()
{ int n,nrap=0;
f>>n;
fr[0]=fr[1]=1;
for(int i=1; i*i<=n; i++)
if(!fr[i])
{ //nrap++;
for(int j=2; j*i<=n; j++) fr[i*j]=1;
}
for(int i=2; i<=n; i++)
if(!fr[i]) nrap++;
g<<nrap;
return 0;
}