Pagini recente » Cod sursa (job #2024962) | Cod sursa (job #1181143) | Cod sursa (job #430430) | Cod sursa (job #2286738) | Cod sursa (job #2754514)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("farfurii.in");
ofstream out("farfurii.out");
int n, flag = 1;
long long k;
int main()
{
in>>n>>k;
while(flag * (flag-1) / 2 < k)
flag++;
for(int i = 1; i <= n-flag; i++)
out<<i<<" ";
k = n - (flag * (flag-1) / 2 - k);
out<<k<<" ";
for(int i = n; i > n-flag; i--)
if(i != k)
out<<i<<" ";
return 0;
}