Pagini recente » Cod sursa (job #2831146) | Cod sursa (job #1662713) | Cod sursa (job #1983524) | Cod sursa (job #1861006) | Cod sursa (job #2690771)
#include <iostream>
#include <cstdio>
using namespace std;
const int NMAX = 100000;
long long n, k, dif;
bool tip = false;
int main() {
freopen("farfurii.in", "r", stdin);
freopen("farfurii.out", "w", stdout);
scanf("%lld %lld", &n, &k);
long long rev = n;
for(long long i = 1; i <= n; i++)
if(!tip && (n - i) * (n - i - 1) / 2 >= k)
printf("%lld ", i);
else if(!tip) {
dif = k - (n - i) * (n - i - 1) / 2 + i;
printf("%lld ", dif);
tip = true;
}
else {
if(rev == dif)
rev--;
printf("%lld ", rev--);
}
return 0;
}