Pagini recente » Cod sursa (job #2541162) | Cod sursa (job #3147062) | Cod sursa (job #1506452) | Cod sursa (job #18194) | Cod sursa (job #494359)
Cod sursa(job #494359)
#include <stdio.h>
#include <math.h>
FILE *in; FILE *out;
long i,j,k=2,N,np=0; bool a[2000010];
int main () {
in=fopen ("ciur.in","r"); out=fopen ("ciur.out","w");
fscanf (in,"%ld",&N);
for (i=2; i<=N; i++) a[i]=1;
while (k<=sqrt (N)) {
while (a[k]==0) k++;
for (j=2; k*j<=N; j++) a[j*k]=0;
k++;
}
for (i=2; i<=N; i++) if (a[i]) np++;
fprintf (out,"%ld\n",np);
fclose (in); fclose (out);
return 0;
}