Cod sursa(job #2379629)
Utilizator | Data | 13 martie 2019 21:15:55 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
int n,i,v[2000005],nrp,j;
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
v[1]=1;
for(i=2; i*i<=n; i++)
{
if(v[i]==0)
{
for(j=i*i; j<=n; j=j+i)
v[j]=1;
}
}
for(i=1; i<=n; i++)
if(v[i]==0)
nrp++;
fout<<nrp;
return 0;
}