Pagini recente » Cod sursa (job #2102170) | Cod sursa (job #461794) | Cod sursa (job #2133279) | Cod sursa (job #2540090) | Cod sursa (job #1366113)
#include <cstdio>
using namespace std;
int n,i,j,x;
long long Max,k,nr=0;
int main()
{
freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
scanf("%d %lld\n",&n,&k);
Max=1LL*n*(n-1)/2;
for(i=1;i<=n;++i)
{
nr+=n-i;
if(k<=Max-nr)
printf("%d ",i);
else
{
x=n-k+(Max-nr);
printf("%d ",x);
for(j=n;j>=i;--j)
if(j!=x)
printf("%d ",j);
break;
}
}
printf("\n");
return 0;
}