Pagini recente » Cod sursa (job #449674) | Cod sursa (job #1555364) | Cod sursa (job #3135805) | Cod sursa (job #2257497) | Cod sursa (job #1396578)
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
bool ciur[2000001]; int n, k = 1;
int main()
{
in >> n;
for (int i = 2; i <= n; i += 2) ciur[i] = 1;
for (long long i = 3; i <= n; i += 2)
if (!ciur[i])
{
k++;
for (long long j = i * i; j <= n; j += i << 1) ciur[j] = 1;
}
out << k << '\n';
out.close(); return 0;
}