Cod sursa(job #1148236)
Utilizator | Data | 20 martie 2014 16:57:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
# include <fstream>
# define N 100010
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int p[N],n;
void ciur()
{
int i,j;
bool ok;
p[++p[0]]=2;
for(i=3; i<=n; i+=2)
{
ok=true;
for(j=1; p[j]*p[j]<=i && j<=p[0] ; ++j)
if(i%p[j]==0)
{
ok=false;
break;
}
if(ok) p[++p[0]]=i;
}
g<<p[0]<<'\n';
}
int main()
{
f>>n;
ciur();
}