Cod sursa(job #2926532)
Utilizator | Data | 17 octombrie 2022 22:05:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, a[2000001], cnt = 0;
int main()
{
fin >> n;
for(int i = 2; i <= n; ++i)
{
if(a[i] == 0)
cnt++;
for(int j = 2; j <= n / i; ++j)
a[i * j] = 1;
}
fout << cnt;
return 0;
}