Pagini recente » Cod sursa (job #1369293) | Cod sursa (job #3217824) | Cod sursa (job #2338943) | Cod sursa (job #1609816) | Cod sursa (job #2216784)
#include <iostream>
#include <fstream>
using namespace std;
#define MAX 2000003
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N, nrPrim = 1;
bool prim[MAX];
void read(void)
{
fin >> N;
}
void ciur(void)
{
if (N >= 2)
{
nrPrim = 1;
}
else
{
nrPrim = 0;
}
for (int i = 3; i < sqrt(N); i += 2)
{
if(!prim[i])
for (int j = i * i; j < N; j += i)
{
prim[j] = true;
}
}
for (int i = 3; i <= N; i += 2)
{
if (!prim[i])
{
nrPrim++;
}
}
}
void print(void)
{
fout << nrPrim;
}
int main(void)
{
read();
ciur();
print();
return 0;
}