Pagini recente » Cod sursa (job #842986) | Cod sursa (job #3191637) | Cod sursa (job #3201386) | Cod sursa (job #3130659) | Cod sursa (job #95707)
Cod sursa(job #95707)
#include<fstream.h>
long n,k;
int main()
{
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long i,m,p;
f>>n>>k;
for(p=1;p<n;p*=2);
for(m=0;p>0;p/=2)
if(m+p<=n&&(m+p)*(m+p-1)<=2*k)
m+=p;
k-=m*(m-1)/2;
if(!k)
{
for(i=1;i<=n-m;i++)
g<<i<<" ";
for(i=n;i>n-m;i--)
g<<i<<" ";
}
else
{
k=m-k;m++;
for(i=1;i<=n-m;i++)
g<<i<<" ";
g<<n-k<<" ";
for(i=n;i>n-k;i--)
g<<i<<" ";
for(i=n-k-1;i>n-m;i--)
g<<i<<" ";
}
g.close();
return 0;
}