Pagini recente » Cod sursa (job #2334897) | Cod sursa (job #708840) | Cod sursa (job #269780) | Cod sursa (job #1760131) | Cod sursa (job #191760)
Cod sursa(job #191760)
#include <stdio.h>
#include <math.h>
int n,nr;
bool v[2000000];
void ciur(){
int i,m;
v[0]=1;
v[1]=1;
for (m=4;m<=n;m+=2)
v[m]=1;
for (i=3;i<=(int)floor(sqrt(n));i+=2){
if (v[i]==0){
m=0;
for (m=i*i;m<=n;m+=i)
v[m]=1;
}
}
nr=1;
for (i=3;i<=n;i+=2)
if (v[i]==0)
++nr;
return;
}
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
ciur();
printf("%d",nr);
return 0;
}