Pagini recente » Cod sursa (job #1322751) | Borderou de evaluare (job #2957373) | Borderou de evaluare (job #1831389) | Cod sursa (job #738871) | Cod sursa (job #1327005)
#include<cstdio>
bool be[100005];
int main()
{
freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
int n,i,j;
long long k;
scanf("%d%lld",&n,&k);
for(i=n;i>=1 && k>=(i-1);i--)
{
k=k-i+1;
be[i]=1;
}
be[k]=1;
for(i=n;i>=1;i--)
if(be[i]==1)
printf("%d ",i);
for(i=1;i<=n;i++)
if(be[i]==0)
printf("%d ",i);
return 0;
}