Cod sursa(job #920415)
Utilizator | Data | 20 martie 2013 12:53:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,nr;
bool prim[2000001];
int main()
{
fin>>n;
for(int i=2;i<=n;i++)
prim[i]=1;
for(int i=2;i<=n;i++)
{
if(prim[i]==1)
for (int m=2;i*m<=n;m++)
prim[i*m]=0;
}
for (int i=1;i<=n;i++)
{
if(prim[i]==1)
nr++;
}
fout<<nr;
return 0;
}