Pagini recente » Cod sursa (job #2531554) | Cod sursa (job #340553) | Cod sursa (job #1753483) | Cod sursa (job #1026223) | Cod sursa (job #1595016)
#include <fstream>
#include <cmath>
using namespace std;
inline int max(int a, int b)
{
if (a > b)
return a;
return b;
}
int main()
{
ifstream in("farfurii.in");
ofstream out("farfurii.out");
int n;
long long k;
in >> n >> k;
long long x = max(sqrt(k)-5, 0);
for (; x <= n; x++)
if ((x * (x-1)) / 2 >= k)
break;
int nx = n - x;
for (int i = 1; i <= nx; i++)
out << i << ' ';
if (x > 0)
{
long long y = k - ((x-1) * (x-2)) / 2 + nx + 1;
out << y << ' ';
for (int i = n; i > nx; i--)
{
if (i == y)
i--;
out << i << ' ';
}
}
out << '\n';
return 0;
}