Pagini recente » Cod sursa (job #405256) | Cod sursa (job #1577681) | Cod sursa (job #2967383) | Cod sursa (job #446269) | Cod sursa (job #2624215)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long long int n, k, i, j, aux, nr ;
int main()
{
f >> n >> k;
aux = n + 1;
j = 1;
while (j * (j - 1) / 2 < k)
{
j++;
}
j = n - j;
for (i = 1; i <= j;i++)
{
g << i << " ";
}
j++;
nr = n - (n - j) * (n - j + 1) / 2 + k;
g << nr << " ";
for(i = n; i >= j; i--)
{
if (i!=nr)
{
g << i << " ";
}
}
return 0;
}