Cod sursa(job #1248584)
| Utilizator | Data | 25 octombrie 2014 16:14:52 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
#include <math.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool a[2000001];
int primec(int n, int nr,bool a[])
{int i,j;
if (n>1000) return 1;
else {
for (i=2;i<=n;i++)
a[i]=1;
for (i=2;i<=sqrt(n);i++)
if (a[i])
for (j=i;j<=n/i;j++)
a[i*j]=0;
for (i=2;i<=n;i++)
if (a[i]) nr++;
return nr;}
}
int main()
{
int nr=0, n,v;
fin>>n;
v=primec(n,nr,a);
fout<<v;
fout.close();
return 0;
}
