Cod sursa(job #1647054)
| Utilizator | Data | 10 martie 2016 18:49:59 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
unsigned N, counter = 0;;
bool *primes;
fin >> 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;
}
}
fout << counter;
delete[] primes;
return 0;
}
