Cod sursa(job #2628587)
Utilizator | Data | 16 iunie 2020 14:58:31 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n, pr;
char v[2000001];
int main()
{
fin >> n;
for (int j = 4; j <= n; j += 2)
v[j] = 'k';
pr++;
for (int i = 3; i <= n; i += 2)
if (v[i] != 'k') {
pr++;
for (int j = i + i; j <= n; j += i)
v[j] = 'k';
}
fout << pr;
return 0;
}