Pagini recente » Cod sursa (job #17677) | Borderou de evaluare (job #1523803) | Cod sursa (job #374882) | Cod sursa (job #374892) | Cod sursa (job #182703)
Cod sursa(job #182703)
#include<stdio.h>
#include<math.h>
FILE *f1,*f2;
long a,b,i,j,n,v[200000003];
int main(){
f1=fopen("ciur.in","r");
f2=fopen("ciur.out","w");
fscanf(f1,"%ld",&n);
for(i=1;i<=n;v[i]=i+1,i++);
a=floor(sqrt(n))+1;
i=1;
b=0;
while(i<=n){
i++;
if(v[i]){
b++;
if(i<a){
for(j=i*2;j<=n;v[j]=0,j=j+i);
}
}
}
fprintf(f2,"%ld",b);
return 0;
}