Pagini recente » Cod sursa (job #907073) | Cod sursa (job #2245758) | Cod sursa (job #2606473) | Cod sursa (job #281704) | Cod sursa (job #1013641)
#include<stdio.h>
#include<math.h>
#include<iostream>
#include<bitset>
using namespace std;
#define MAXN 2000001
bitset <MAXN> ciur;
int main () {
FILE *f,*g;
f=fopen("ciur.in","r");
g=fopen("ciur.out","w");
int n, i, j,nr;
fscanf(f,"%d",&n);
int p = sqrt(n);
for( int i = 3; i <= p; i= i + 2) {
for(j= i * i ; j <= n; j = j + 2 * i) {
ciur[j]=1;
}
}
nr=1;
for(i=3; i<=n; i += 2)
if(ciur[i]==0)
nr++;
fprintf(g,"%d\n",nr);
fclose(f);
fclose(g);
return 0;
}