Cod sursa(job #894451)
Utilizator | Data | 26 februarie 2013 21:24:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
bool prim[2000005], nr;
int main()
{
ifstream in ("ciur.in");
ofstream out ("ciur.out");
int i, j, n;
in>>n;
for (i=2; i<=n; i++)
prim[i]=1;
for (i=2; i<=n; i++)
if (prim[i])
{
nr++;
for (j=i*i; j<=n; j+=i)
prim[j]=0;
}
out<<nr;
return 0;
}