Pagini recente » Cod sursa (job #1037309) | Cod sursa (job #810058) | Cod sursa (job #1328912) | Cod sursa (job #1093279) | Cod sursa (job #2718600)
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int nmax = 2000000;
int a[nmax + 10];
void Ciur(int n)
{
for (int i = 4; i <= n; i += 2)
a[i] = 1;
for (int i = 3; i*i <= n; i += 2)
if (a[i] == 0)
for (int j = i*i; j <= n; j += 2*i)
a[j] = 1;
}
int main()
{
int n;
fin >> n;
Ciur(n);
int nr = 0;bn
for (int i = 2; i <= n; i++)
if (a[i] == 0) nr++;
fout << nr;
fin.close();
fout.close();
return 0;
}