Pagini recente » Cod sursa (job #3125039) | Cod sursa (job #2087365) | Cod sursa (job #1675336) | Cod sursa (job #1257704) | Cod sursa (job #2088758)
#include <fstream>
using namespace std;
bool c[2000000];
int main () {
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int p, w, n, i, s;
c[0] = c[1] = 1;
p = w = 2;
fin>>n;
while ( p * p <= n ) {
w = p*2;
while ( w <= n ) {
c[w] = 1;
w += p;
}
do p++;
while ( c[p] && p <= n );
}
s = 0;
for ( i = 0; i <= n; i++ )
s += (c[i]+1)%2;
fout<<s;
return 0;
}