Pagini recente » Cod sursa (job #2468114) | Cod sursa (job #1546032) | Cod sursa (job #1022053) | Cod sursa (job #768717) | Cod sursa (job #2902083)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("farfurii.in");
ofstream fout ("farfurii.out");
int main()
{
int n,k;
fin>>n>>k;
int i = 0;
while(k > i*(i+1)/2)i++;
for(int j = 1; j < n-i; j++)fout<<j<<" ";
i--;
int nr_inv = i*(i+1)/2;
int nr_completare_inv = n - i + k - nr_inv - 1;
fout<< nr_completare_inv <<" ";
for(int j = 0; j < i+2 ; j++)
if(n - j != nr_completare_inv)
fout<<n-j<<" ";
return 0;
}