Cod sursa(job #893911)
Utilizator | Data | 26 februarie 2013 18:43:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
char prim[2000001];
int n,i,j,nr;
int main()
{ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
nr=0;
for(i=2;i*i<=n;i++)
if(prim[i]==0)
{for(j=i*i;j<=n;j+=i)
prim[j]=1;
}
for(i=2;i<=n;i++)
if(prim[i]==0)
nr++;
fout<<nr;
return 0;
}