Cod sursa(job #3221509)
Utilizator | Data | 7 aprilie 2024 12:14:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool ciur[2000001];
int main()
{
int i, n, cnt = 0;
cin >> n;
for (i = 2; i <= n; i++)
for (int j = i * 2; j <= n; j += i)
ciur[j] = 1;
for (i = 2; i <= n; i++)
{
if (!ciur[i])
{
// cout << i << ' ';
cnt++;
}
}
cout << cnt;
}