Pagini recente » Cod sursa (job #1650789) | Cod sursa (job #172774) | Cod sursa (job #574606) | Cod sursa (job #865043) | Cod sursa (job #2542645)
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, counter;
bool fr[2000001];
int main()
{
fr[0] = true;
fr[1] = true;
fin >> n;
for (int i = 2; i * i <= n; i++) {
if (fr[i] == 0) {
for (int j = i; j <= n / i; j++)
fr[i * j] = true;
}
}
for (int i = 2; i <= n; i++) {
if (!fr[i])
counter ++;
}
fout << counter;
return 0;
}