Mai intai trebuie sa te autentifici.
Cod sursa(job #948457)
Utilizator | Data | 10 mai 2013 14:59:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#define NMax 2000000
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int v[NMax], n;
int main (void)
{
int i, j, nr=0;
f>>n;
for (i=2; i<NMax; i++) v[i]=1;
for (i=2; i*i<=NMax; i++)
if (v[i])
for (j=2; j*i<NMax; j++)
v[i*j]=0;
for (i=2; i<n; i++)
if (v[i]) nr++;
g<<nr;
f.close();
g.close();
return 0;
}