Pagini recente » Cod sursa (job #747394) | Cod sursa (job #1744308) | Cod sursa (job #1841970) | Cod sursa (job #209669) | Cod sursa (job #2626699)
#include <bits/stdc++.h>
using namespace std;
int main()
{
freopen("farfurii.in", "r", stdin);
freopen("farfurii.out", "w", stdout);
long long n, k;
scanf("%lld %lld",&n,&k);
long long i, p
;
int ok = 1;
for(i=1;i<=n && ok == 1;i++)
{
if(i*(i-1)/2 <= k && i*(i+1)/2 > k)
{p = i-1;
ok = 0;
}
}
for(i=1;i<=p-1;i++)
printf("%lld ",i);
long long k1;
k1 = p + k - (p-1)*p/2;
printf("%lld ",k1);
for(i=n;i>=k1+1;i--)
printf("%lld ",i);
for(i=k1-1;i>=p+1;i++)
printf("%lld ",i);
return 0;
}