Cod sursa(job #187504)
| Utilizator | Data | 4 mai 2008 13:22:06 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <cstdio>
#include <vector>
using namespace std;
long N;
void ciur()
{
int cnt = 1;
vector <bool> V(N+1);
for(long i=3; i<=N; i +=2)
{
if(V[i]) continue;
for(long j=i + (i << 1); j <= N; j += i)
V[j] = 1;
++ cnt;
}
printf("%d\n",cnt);
}
int main()
{
freopen("ciur.in","rt",stdin);
freopen("ciur.out","wt",stdout);
scanf("%ld",&N);
ciur();
}
