Pagini recente » Cod sursa (job #1469381) | Cod sursa (job #925003) | Cod sursa (job #2725581) | Cod sursa (job #349140) | Cod sursa (job #2752115)
//ALEX ENACHE
#include <algorithm>
using namespace std;
//#include <iostream>
#include <fstream>
//ifstream cin("input"); ofstream cout("output");
ifstream cin("farfurii.in"); ofstream cout("farfurii.out");
int main() {
long long n, k;
cin >> n >> k;
int poz = n;
int skip = 0;
for (long long i = 1; i <= n; i++) {
poz = n - i + 1;
if (i * (i - 1) / 2 >= k) {
skip = i * (i - 1) / 2 - k;
break;
}
}
for (int i = 1; i < poz; i++) {
cout << i << " ";
}
cout << n - skip << " ";
for (int i = n; i >= poz; i--) {
if (i == n - skip) continue;
cout << i << " ";
}
}