Cod sursa(job #1107751)
| Utilizator | Data | 14 februarie 2014 11:23:06 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{int i,j,terminat=0,a[1000],b[1000];
long n;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
f>>n;
for (i=0;i<(n-1)/2;i++) a[i]=2*i+3;
b[0]=2;j=0;
while (!terminat)
{for (i=0;i<(n-1)/2;i++)
if (a[i]%b[j]==0) a[i]=0;
for (i=0;a[i]==0;i++);
if (i<(n-1)/2) b[++j]=a[i];
else terminat=1;
}
g<<j+1;
f.close();
g.close();
return 0;
}
