Pagini recente » Cod sursa (job #907436) | Cod sursa (job #947174) | Cod sursa (job #2642890) | Cod sursa (job #112416) | Cod sursa (job #2461576)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
ll k;
ll get (ll i)
{
return (n - i) * (n - i - 1) / 2;
}
int main()
{
freopen ("farfurii.in", "r", stdin);
freopen ("farfurii.out", "w", stdout);
cin >> n >> k;
int i = 1;
while (get (i) >= k)
cout << i++ << " ";
k -= get (i);
cout << i + k << " ";
for (int j = n; j >= i; j--)
if (j != i + k)
cout << j << " ";
return 0;
}