Pagini recente » Cod sursa (job #2782793) | Cod sursa (job #2551507) | Cod sursa (job #1453023) | Cod sursa (job #3232074) | Cod sursa (job #2972477)
#include <iostream>
#include <fstream>
#include <cstring>
#define NMAX 2000001
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int SieveOfEratosthenes(int n)
{
int cnt=0;
bool prime[NMAX];
memset(prime, true, sizeof(prime));
for (int p = 2; p * p <= n; p++) {
if (prime[p] == true) {
for (int i = p * p; i <= n; i += p)
prime[i] = false;
}
}
for (int p = 2; p <= n; p++)
if (prime[p])
cnt++;
return cnt;
}
int main(){
int n;
fin>>n;
fout<<SieveOfEratosthenes(n);
return 0;
}