Pagini recente » Cod sursa (job #1780183) | Cod sursa (job #1133550) | oji_11_2023 | Cod sursa (job #487054) | Cod sursa (job #2263890)
#include <fstream>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
int N;
long long K;
int main()
{
fin >> N >> K;
int numbersToDisplay = 0;
long long counter = N;
while((counter * (counter - 1)) / 2 > K)
numbersToDisplay++, counter--;
for(int i = 1; i < numbersToDisplay; i++)
fout << i << ' ';
int current = K - ((counter - 1) * (counter - 2)) / 2;
fout << current << ' ';
for(int i = N; i >= N - counter; i--)
if(i != current)
fout << i << ' ';
return 0;
}