Cod sursa(job #2846183)
| Utilizator | Data | 8 februarie 2022 21:26:44 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
long long int frec[2000005];
int main()
{
long long int n, cnt = 0;
fin >> n;
for(int i = 2; i <= n; i++){
if (frec[i] == 0){
cnt++;
for(int j = i + i; j <= n; j = j + i){
frec[j] = 1;
}
}
}
fout << cnt;
return 0;
}
