Cod sursa(job #167562)
| Utilizator | Data | 29 martie 2008 19:20:07 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include<stdio.h>
#define N 2000005
bool v[N+1];
int n,x;
int ciur(){
int i,j,nr=1;
x=1;
for (i=3;i<=n;i+=2)
if (v[i]==false){
++x;
++nr;
if (i<=32000)
for (j=i*i;j<=n;j+=i)
v[j]=true;
}
return nr;
}
int main(){
//timer t;
int i;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
printf("%d\n",ciur());
return 0;
}
