Cod sursa(job #356324)
| Utilizator | Data | 14 octombrie 2009 13:19:41 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
unsigned long N,i;
unsigned int v[2000000];
long era() {
long x,nr,i;
nr=N-2;
for(i=2; i<=N; i++)
if(v[i]!=0)
for(x=i; x*i<N; x++)
{ nr--; v[x*i]=0; }
return nr;
}
int main() {
in>>N;
for(i=2; i<=N; i++) v[i]=1;
out<<era();
return 0;
}
