Pagini recente » Cod sursa (job #269162) | Cod sursa (job #2675240) | Cod sursa (job #581821) | Cod sursa (job #2115553) | Cod sursa (job #2755265)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
long long k, index_permutare=1;
int n, nr_permutat;
ifstream f("farfurii.in");
f >> n >> k;
f.close();
while (index_permutare * (index_permutare - 1) / 2 <= k)
index_permutare++;
ofstream g("farfurii.out");
for (int i=1; i <= n-index_permutare; i++)
g << i << " ";
nr_permutat = n - (index_permutare * (index_permutare - 1) / 2 - k);
g<<nr_permutat<<" ";
for (int i=n; i > n-index_permutare; i--)
if (i != nr_permutat)
g << i << " ";
g.close();
}