Cod sursa(job #913051)
Utilizator | Data | 13 martie 2013 08:31:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
#include <cstring>
using namespace std;
ifstream in ("ciur.in"); ofstream out ("ciur.out");
int main()
{
int n;
in >> n;
bool* ciur = new bool[n];
memset(ciur,0,n);
for(int i = 2; i < n/2; i++)
{
if(!ciur[i])
{
for(int j = i+i; j < n; j+=i)
{
ciur[j]=1;
}
}
}
int nrDiv=0;
for(int i = 2; i <n; i++)
{
if(!ciur[i])nrDiv++;
}
out << nrDiv;
}