Cod sursa(job #2926527)
Utilizator | Data | 17 octombrie 2022 22:00:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 40 |
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");
int n, a[2000001];
int main()
{
fin >> n;
a[0] = 1, a[1] = 1;
for(int i = 2; i * i <= n; ++i)
{
for(int j = 2; j <= n / i; ++j)
{
a[i * j] = 1;
}
}
int cnt = 0;
for(int i = 2; i <= n; ++i)
if(!a[i])
cnt++;
fout << cnt;
return 0;
}