Cod sursa(job #1528928)
| Utilizator | Data | 20 noiembrie 2015 11:18:28 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream in ("ciur.in");
ofstream out("ciur.out");
int main()
{
int a[1001];
int nr = 0, n, i, j;
in >> n;
for (i = 2; i <= n; i++)
a[i] = 1;
for (i = 2; i <= sqrt(n); i++)
if (a[i] != 0)
for (j = 2; j <= n / i; j++)
a[i*j] = 0;
for (i = 2; i <= n; i++)
if (a[i] != 0)
nr++;
out << nr << endl;
return 0;
}
