Cod sursa(job #523742)
Utilizator | Data | 19 ianuarie 2011 08:57:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream.h>
#define NMAX 2000001
int i,j,n,nr=0;
char v[NMAX];
int main()
{ifstream f11("ciur.in");
ofstream g11("ciur.out");
f11>>n;
for(i=2;i<=n;i++)
if(v[i]==0)
{nr++;
for(j=i+i;j<=n;j=j+i) v[j]=1;
}
g11<<nr<<'\n';
g11.close();
return 0;
}