Pagini recente » Cod sursa (job #1521748) | Cod sursa (job #13929) | Cod sursa (job #2733963) | Cod sursa (job #311978) | Cod sursa (job #2605871)
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
long long n, k, s;
int main()
{
fin >> n >> k;
long long v = (k << 1LL);
v = sqrt(v) + 1;
for (int i = 1; i <= n - v; ++i)
fout << i << " ";
s = v * (v - 1);
s >>= 1;
if (s == k)
s = n;
else
s = s - k + n - v + 1;
fout << s << " ";
for (int i = n; i > s; --i)
fout << i << " ";
for (int i = s - 1; i > n - v; --i)
fout << i << " ";
fout.close();
return 0;
}