Pagini recente » Cod sursa (job #787236) | Cod sursa (job #2654222) | Cod sursa (job #808696) | Cod sursa (job #1918308) | Cod sursa (job #2904542)
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
double x;
long long n, m, k;
int main()
{
int i;
fin >> n >> k;
x = (1 + sqrt((double)1 + 8 * k)) / 2;
m = (long long)x;
if (x == m)
{
for (i = 1; i <= n - m; i++)
fout << i << " ";
for (i = 1; i <= m; i++)
fout << n - i + 1 << " ";
}
else
{
for (i = 1; i <= n - m - 1; i++)
fout << i << " ";
fout << n - ((m + 1) * m / 2 - k) << " ";
for (i = 0; i < (m + 1) * m / 2 - k; i++)
fout << n - i << " ";
for (i = (m + 1) * m / 2 - k + 1; i <= m; i++)
fout << n - i << " ";
}
fin.close();
fout.close();
return 0;
}