Pagini recente » Cod sursa (job #2459051) | Cod sursa (job #3133777)
#include <iostream>
#include <fstream>
#include <cmath>
#include <vector>
using namespace std;
int main() {
ifstream inputFile("farfurii.in");
int n;
long long k;
inputFile >> n >> k;
inputFile.close();
long long m = (1 + sqrt(1 + 8 * k)) / 2;
ofstream outputFile("farfurii.out");
if (2 * k == m * (m - 1)) {
for (int i = 1; i <= n - m; i++) {
outputFile << i << " ";
}
for (int i = 0; i < m; i++) {
outputFile << n - i << " ";
}
outputFile << "\n";
} else {
long long p = m * (m + 1) / 2;
for (int i = 1; i <= n - m - 1; i++) {
outputFile << i << " ";
}
outputFile << n + k - p << " ";
for (int i = 0; i <= m; i++) {
if (i != p - k) {
outputFile << n - i << " ";
}
}
outputFile << "\n";
}
outputFile.close();
return 0;
}