Pagini recente » Cod sursa (job #2837135) | Cod sursa (job #335122) | Cod sursa (job #2255824) | Cod sursa (job #1804715) | Cod sursa (job #2867998)
#include <stdio.h>
#include <iostream>
using namespace std;
int nrPrime;
bool nuEPrim[200005];
void Ciur(int n)
{
nuEPrim[0] = true;
nuEPrim[1] = true;
for (int i = 4; i <= n; i += 2)
{
nuEPrim[i] = true;
}
//cout << nuEPrim[3] << ' ';
for (int i = 3; i <= n; i += 2)
{
//cout << i << ' ' << nuEPrim[i] << '\n';
if (nuEPrim[i] == false)
{
//cout << 1;
for (int j = 2 * i; j <= n; j = j + i)
{
//cout << j << ' ';
nuEPrim[j] = true;
}
}
}
}
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int n;
scanf("%i", &n);
//cin >> n;
Ciur(n);
for (int i = 2; i <= n; i++)
{
if (nuEPrim[i] == false)
{
//cout << i << ' ';
nrPrime++;
}
}
printf("%i", nrPrime);
//cout << nrPrime;
return 0;
}