Cod sursa(job #1274394)
Utilizator | Data | 23 noiembrie 2014 19:30:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <math.h>
using namespace std;
int main()
{
ifstream f;
ofstream g;
f.open("ciur.in");
g.open("ciur.out");
bool a[2000001];
int nr=0, n, i, j;
f>>n;
for (i=2; i<=n; i++)
a[i]=1;
for (i=2; i<=sqrt(n); i++)
if (a[i])
for (j=i; j<=n/i; j++)
a[i*j]=0;
for (i=2; i<=n; i++)
if (a[i]) nr++;
g<<nr;
g.close();
return 0;
}