Cod sursa(job #184814)
Utilizator | Data | 24 aprilie 2008 12:52:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<stdio.h>
long n,k=2;
int main()
{
long i;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%ld",&n);
if(n==2){
printf("1\n");
return 0;
}
if(n==3){
printf("2\n");
return 0;
}
for(i=4;i<=n;i++){
if(i%2==0 || i%3==0)
continue;
else
++k;
}
printf("%ld\n",k);
return 0;
}