Cod sursa(job #783458)
Utilizator | Data | 2 septembrie 2012 21:38:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,x,v[2000000],i,t,y=1,p,r;
int main()
{f>>n;
for(i=1;i<=n-1;i++)
v[i]=i+1;
x=2;
t=2;
p=n-1;
while(t<p)
{r=t;
for(i=t;i<=p;i++)
{if(v[i]%x!=0)
{v[r]=v[i];
r++;}
}
p=r-1;
t++;
x=v[t-1];
}
g<<t;
return 0;
}