Pagini recente » Cod sursa (job #9741) | Cod sursa (job #330645) | Cod sursa (job #2079682) | Cod sursa (job #1578170) | Cod sursa (job #29239)
Cod sursa(job #29239)
#include<stdio.h>
#include<math.h>
long n,k,m,i,j,p;
int main()
{freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
scanf("%ld %ld",&n,&k);
for(p=1;p<n;p=p*2);
for(m=0;m<n&&m*(m+1)<=2*k;m++);
k=k-m*(m-1)/2;
if(!k){
for(i=1;i<=n-m;i++)
printf("%ld ",i);
for(i=n;i>n-m;i--)
printf("%ld ",i);}
else {k=m-k;m++;
for(i=1;i<=n-m;i++)
printf("%ld ",i);
printf("%ld ",n-k);
for(i=n;i>n-m;i--)
if(i!=n-k) printf("%ld ",i);}
fclose(stdout);
return 0;}