Pagini recente » Cod sursa (job #1786271) | Cod sursa (job #284172) | Cod sursa (job #1896015) | Cod sursa (job #2899457) | Cod sursa (job #2903503)
#include<iostream>
#include<fstream>
using namespace std;
long long n, k, j;
int main() {
ifstream f("farfurii.in");
ofstream g("farfurii.out");
f >> n >> k;
int i = 1;
while (((n - i) * (n - i - 1)) / 2 > k) {
g << i << " ";
i++;
}
int rest = k - ((n - i) * (n - i - 1)) / 2;
g << i + rest<<" ";
for (j = n; j >= i; j--)
if (j != i + rest)
g << j << " ";
return 0;
}