Pagini recente » Cod sursa (job #37061) | Cod sursa (job #1400065) | Cod sursa (job #2731565) | Cod sursa (job #2935613) | Cod sursa (job #2903499)
#include<iostream>
#include<fstream>
using namespace std;
int 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;
}