Cod sursa(job #2509464)
| Utilizator | Data | 14 decembrie 2019 11:25:33 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main() {
int n, nr = 0;
bool v[1500] = { true };
fin >> n;
for (int i = 1; i <= n; i++)
v[i] = true;
for(int i = 2; i <= sqrt(n); i++)
if (v[i] == true)
for (int j = i * i; j <= n; j = j + i)
v[j] = false;
for (int i = 2; i <= n; i++)
if (v[i] == true) nr++;
fout << nr;
}