Pagini recente » Cod sursa (job #2899675) | Cod sursa (job #75201) | Cod sursa (job #2105465) | Cod sursa (job #1965027) | Cod sursa (job #1470813)
/*
code by purplecoder
*/
#include <fstream>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
int n;
long long k;
int main()
{
fin>>n>>k;
for(int i=1; i<=n; ++i)
{
if((long long) (n-i)*(n-i-1)/2 < k)
{
long long val = (long long) (n - i) * (n - i - 1) / 2;
for(int j=i+1; j<=n; ++j)
{
++val;
if (val == k)
{
fout<<j<<' ';
for(int k=n; k>=i; --k)
if(k!=j)
fout<<k<<' ';
return 0;
}
}
} else
fout << i << " ";
}
return 0;
}