Pagini recente » Cod sursa (job #168233) | Cod sursa (job #1729581) | Cod sursa (job #682605) | Cod sursa (job #3135767) | Cod sursa (job #2259883)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n, i, j, nr = 0;
const int long lim = 2000000;
int ciur[lim + 1];
int main() {
ciur[0] = 1;
ciur[1] = 1;
for (i = 2; i * i <= lim; i++)
if (ciur[i] == 0)
for (j = 2; j <= lim / i; j++)
ciur[i * j] = 1;
fin >> n;
for (i = 1; i <= n; i++)
if (ciur[i] == 0)
nr++;
fout << nr;
fin.close();
fout.close();
return 0;
}