Pagini recente » Cod sursa (job #265149) | Cod sursa (job #2462510) | Cod sursa (job #2520877) | Cod sursa (job #3209410) | Cod sursa (job #1843510)
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
#define MAX 100000
int main()
{
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
int n, k;
fin >> n >> k;
int inv = ceil((sqrt(8 * k + 1) + 1) / 2);
int dist = inv * (inv - 1) / 2 - k;
int i, j;
for (i = 0; i < n - inv; i++) {
fout << i + 1 << " ";
}
fout << n - dist << " ";
for (j = n - 1; j > n - 1 - dist; j--) {
fout << j + 1 << " ";
}
j--;
for (; j >= i; j--) {
fout << j + 1 << " ";
}
fin.close();
fout.close();
return 0;
}