Pagini recente » Cod sursa (job #3228025) | Istoria paginii runda/tema_3 | Cod sursa (job #2758115) | Istoria paginii runda/lot_3 | Cod sursa (job #3175746)
#include <stdio.h>
#include <stdbool.h>
#define MAXN 2000000
bool ciur[MAXN+1];
int sml[MAXN+1];
int prime = 0;
int main(){
ciur[0]=ciur[1]=0;
for(int i=2; i*i<=MAXN; i++){
if(!ciur[i]){
prime++;
for(int d=i*i; d<=MAXN; d+=i)
ciur[d]=true;
}
sml[i] = prime;
}
int n;
FILE *fin, *fout;
fin = fopen("ciur.in", "r");
fscanf(fin, "%d", &n);
fclose(fin);
fout = fopen("ciur.out", "w");
fprintf(fout, "%d\n", sml[n]);
fclose(fout);
return 0;
}