Pagini recente » Cod sursa (job #2188536) | Cod sursa (job #1854585) | Cod sursa (job #2297049) | Cod sursa (job #2644943) | Cod sursa (job #763614)
Cod sursa(job #763614)
#include <stdio.h>
char prime[1000009];
int i, j, nr, n;
int main()
{
FILE *in = fopen("ciur.in", "r");
FILE *out = fopen("ciur.out", "w");
fscanf(in, "%d", &n);
nr = 1;
for(i = 1; ((i*i) << 1) + (i << 1) <= n; ++i)
if(!prime[i])
for(j = ((i*i) << 1) + (i << 1); (j << 1) + 1 <= n; j += (i << 1) + 1)
prime[i] = 1;
for(i = 1; i < (n >> 1); i++)
if(!prime[i])
nr++;
fprintf(out, "%d\n", nr);
fclose(in);
fclose(out);
return 0;
}