Pagini recente » Cod sursa (job #322209) | Cod sursa (job #401904) | Cod sursa (job #2673706) | Cod sursa (job #2474371) | Cod sursa (job #2626077)
#include <fstream>
using namespace std;
int main() {
ifstream f ("farfurii.in");
ofstream g ("farfurii.out");
long long n, k;
f >> n >> k;
long long maxCresc = 1;
while (maxCresc * (maxCresc - 1) / 2 < k) {
maxCresc++;
}
long long x = maxCresc * (maxCresc - 1) / 2;
for (long long i = 1; i <= n - maxCresc; i++) {
g << i << " ";
}
g << n - x + k;
for (long long i = n; i >= n - maxCresc + 1; i--) {
if (i == n - x + k)
continue;
g << " " << i;
}
g << "\n";
return 0;
}