Cod sursa(job #1534057)
| Utilizator | Data | 23 noiembrie 2015 11:19:06 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int a[1001];
int nr = 0, n, i, j;
cout << "Numerele pana la: ";
cin >> 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++;
cout << nr << endl;
return 0;
}
