Pagini recente » Cod sursa (job #1949783) | Cod sursa (job #2901036) | Cod sursa (job #2437028) | Cod sursa (job #1195835) | Cod sursa (job #2438574)
#include<cstdio>
#define MAX_N 2000000
bool prim[MAX_N+1];
int n;
int main() {
int i, j, cnt;
FILE* fin, *fout;
fin = fopen("ciur.in","r");
fout = fopen("ciur.out","w");
fscanf(fin,"%d",&n);
cnt = 0;
prim[0] = prim[1] = 1;
for(i = 2; i <= n; i++) {
if(prim[i] == 0) {
cnt++;
for(j = 2 * i; j <= n; j += i)
prim[j] = 1;
}
}
fprintf(fout,"%d\n",cnt);
fclose(fin);
fclose(fout);
return 0;
}