Cod sursa(job #1731725)
Utilizator | Data | 19 iulie 2016 18:25:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int erathostene (int n)
{
bool a[n+1];
int nr,i,j;
a[0]=true;
a[1]=true;
for(i=2;i<=n;i++) a[i]=false;
for(i=2;i<=n; i++) if(a[i] == false) { nr++;
for(j = i + i; j <= n; j += i) a[j]=true;
}
return nr;
}
int main()
{ int m;
f>>m;
g<<erathostene(m);
return 0;
}