Pagini recente » Cod sursa (job #4426) | Cod sursa (job #1589896) | Cod sursa (job #1323018) | Cod sursa (job #335995) | Cod sursa (job #3265800)
#include <iostream>
#include <fstream>
#include <cmath>
#include <algorithm>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
int n, k;
int main() {
fin >> n >> k;
int tacamuri = 1;
while (tacamuri * (tacamuri + 1) / 2 < k)
tacamuri++;
for (int i = 1; i < n - tacamuri; i++)
fout << i << " ";
fout << n + k - (tacamuri * (tacamuri + 1) / 2) << " ";
for (int i = n; i >= n - tacamuri; i--) {
if (i != n + k - (tacamuri * (tacamuri + 1) / 2))
fout << i << " ";
}
return 0;
}