Cod sursa(job #342081)
| Utilizator | Data | 20 august 2009 16:00:55 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <cstdio>
using namespace std;
char pr[2000001];
long N,cnt;
int main() {
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%ld",&N);
for (long i=2;i<=N;++i) pr[i] = 1;
for (long i=2;i<=N;++i) {
if (pr[i]) {
cnt++;
for (long j=i+i;j<=N;j+=i) pr[j] = 0;
}
}
printf("%ld",cnt);
fclose(stdin);
fclose(stdout);
return 0;
}
