Pagini recente » Cod sursa (job #1822861) | Cod sursa (job #3218053) | Cod sursa (job #675760) | Cod sursa (job #875752) | Cod sursa (job #1482997)
#include <cstdio>
using namespace std;
long long n, k, m;
int main(){
freopen("farfurii.in", "r", stdin);
freopen("farfurii.out", "w", stdout);
scanf("%lld %lld", &n, &k);
m = 1;
while(m * (m - 1) < 2 * k)
m++;
k = (m * (m - 1) / 2) - k;
k = n - k;
for(int i = 1; i <= n - m; ++i)
printf("%d ", i);
printf("%lld ", k);
for(int i = n; i > n - m; --i)
if(i != k)
printf("%d ", i);
return 0;
}