Pagini recente » Cod sursa (job #506391) | Cod sursa (job #3142405) | Borderou de evaluare (job #2912400) | Cod sursa (job #2205309) | Cod sursa (job #3141974)
#include <iostream>
#include <fstream>
#define NMAX 2000001
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool ciur[NMAX + 1];
int n, cnt, i;
void Ciur(int n)
{
int i = 2, j;
while (i <= n)
{
if (ciur[i] == 0)
{
j = 2;
while (i * j <= n)
ciur[i * j] = 1, j++;
}
i++;
}
}
int main()
{
f >> n;
Ciur(n);
for (i = 2; i <= n; i++)
if (!ciur[i])
cnt++;
g << cnt;
f.close();
g.close();
return 0;
}