Pagini recente » Cod sursa (job #1616434) | Cod sursa (job #1754075) | Cod sursa (job #1981211) | Cod sursa (job #2530460) | Cod sursa (job #2784915)
#include <fstream>
using namespace std;
ifstream cin("farfurii.in");
ofstream cout("farfurii.out");
int main () {
long long n, k, m = 0;
cin >> n >> k;
while (m * (m + 1) / 2 <= k) {
m ++;
}
m --;
if (k - m * (m + 1) / 2 == 0) {
for (int i = 1; i <= n - m - 1; i ++) {
cout << i << " ";
}
for (int i = n; i >= n - m; i --) {
cout << i << " ";
}
}
else {
long long r = k - m * (m + 1) / 2;
for (int i = 1; i <= min(n - m, n - m - r - 1); i ++) {
cout << i << " ";
}
if (min(n - m, n - m - r) == n - m - r) {
cout << n << " ";
}
for (int i = min(n - m, n - m - r); i <= n - m - 1; i ++) {
if (i == n - m - r - 1) {
cout << n << " ";
continue;
}
cout << i << " ";
}
for (int i = n - 1; i >= n - m; i --) {
cout << i << " ";
}
}
return 0;
}