Cod sursa(job #1647048)
Utilizator | Data | 10 martie 2016 18:47:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
using namespace std;
int main()
{
unsigned N, counter = 0;;
bool *primes;
cin >> N;
primes = new bool [N];
for(unsigned i = 2; i <= N; ++i)
primes[i] = 1;
for(unsigned i = 2; i <= N; ++i)
{
if(primes[i])
{
for(unsigned j = i * i; j <= N; j += i)
primes[j] = 0;
++counter;
}
}
cout << counter;
delete[] primes;
return 0;
}