Pagini recente » Cod sursa (job #275817) | Cod sursa (job #2779423) | Cod sursa (job #187212) | Cod sursa (job #303907) | Cod sursa (job #1155922)
#include <cstdio>
using namespace std;
int main()
{
freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
long long n,k,i;
scanf("%lld%lld",&n,&k);
i=n+1;
while(i>1)
{
if(i/2*(i-1)>=k)
{
i--;
}
else
{
k=i*(i-1)/2-k;
break;
}
}
long long ult=n-i+1;
for(i=1;i<ult;i++)
printf("%lld ",i);
if(ult!=0)
printf("%lld ",n-k);
for(i=n;i>=ult;i--)
{
if(i!=n-k)
printf("%lld ",i);
}
return 0;
}