Pagini recente » Cod sursa (job #1227215) | Cod sursa (job #961162) | Cod sursa (job #1263319) | Cod sursa (job #685185) | Cod sursa (job #2564572)
#include<stdio.h>
int main(){
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n;
scanf("%d",&n);
int p[n+2];
for(int i=1;i<=n;i++) p[i]=0;
p[1] = 1;
p[0] = 1;
for(int i=2;i<=2;i++){
if(p[i]) continue;
int j = 2;
int k = n/i;
while(j<=k){
p[i*j]=1;
j++;
}
}
for(int i=3;i<=n;i+=2){
if(p[i]) continue;
int j = 2;
int k = n/i;
while(j<=k){
p[i*j]=1;
j++;
}
}
int c=0;
for(int i=1;i<=n;i++) if(!p[i]){c++;}
printf("%d",c);
}