Pagini recente » Cod sursa (job #971317) | Cod sursa (job #1693385) | Cod sursa (job #523769) | Monitorul de evaluare | Cod sursa (job #2020035)
#include <cstdio>
using namespace std;
int main()
{
long long int n, k;
freopen("farfurii.in", "r", stdin);
freopen("farfurii.out", "w", stdout);
scanf("%lld%lld", &n, &k);
long long int p = 1;
while(p * (p + 1) / 2 <= k) {
++p;
}
for(long long int i = 1; i < n - p; ++i) {
printf("%lld ", i);
}
long long int r = n + k - p * (p + 1) / 2;
printf("%lld ", r);
for(long long int i = n; i >= n - p; --i) {
if(i != r) {
printf("%lld ", i);
}
}
printf("\n");
return 0;
}