Cod sursa(job #2527892)
Utilizator | Data | 21 ianuarie 2020 00:02:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;
void ciur(int v[], int n, int &nr)
{
int i = 2, j;
while (i <= n) {
if (v[i] != -1) {
++nr;
for (j = i + i; j <= n; j += i)
v[j] = -1;
}
++i;
}
}
int main()
{
int n, i, nr = 0;
ifstream fin("ciur.in");
fin >> n;
int v[n] = {};
ofstream fout("ciur.out");
ciur(v, n, nr);
fout << nr;
return 0;
}