Pagini recente » Cod sursa (job #70127) | Cod sursa (job #689584) | Cod sursa (job #1613801) | Cod sursa (job #2918308) | Cod sursa (job #2903458)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
long long n, k;
int main()
{
long long m;
int i;
fin >> n >> k;
m = 1;
while ((m * (m - 1) / 2) < k)
m++;
if (k == (m * (m - 1)) / 2)
{
for (i = 1; i <= n - m; i++)
fout << i << " ";
for (i = n; i >= n - m + 1; i--)
fout << i << " ";
return 0;
}
m--;
for (i = 1; i <= n - m - 1; i++)
fout << i << " ";
fout << n - (((m) * (m + 1)) / 2) + k << " ";
for (i = n; i >= n - m; i--)
if (i != n - (((m) * (m + 1)) / 2) + k)
fout << i << " ";
return 0;
}