Pagini recente » Cod sursa (job #1722839) | Cod sursa (job #2550961) | Cod sursa (job #321697) | Cod sursa (job #2675933) | Cod sursa (job #59246)
Cod sursa(job #59246)
#include<fstream.h>
ifstream f("order.in");
ofstream g("order.out");
int a[35000],b[35000],i,j,cont,n,l,x;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
cont=0;
l=1;
j=1;
while(cont!=n-1)
{
for(i=l;i<=n;i+=j)
{
if(b[i]==0)
{
g<<a[i]<<" ";
b[i]=1;
cont++;
}
j++;
}
x=n%j;
l=j-n;
}
for(i=1;i<=n;i++)
if(b[i]==0)
{
g<<a[i]; break; }
f.close();
g.close();
return 0;
}