Pagini recente » Cod sursa (job #871007) | Cod sursa (job #2252134) | Cod sursa (job #848763) | Cod sursa (job #3277234) | Cod sursa (job #2188555)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
int main()
{
int n;
long long k;
fin >> n >> k;
if(k==0)
{
for(int i=1;i<=n;i++) fout << i << ' ';
return 0;
}
k=(long long)n*(n-1)/2-k;
int aux=n-1;
while(k-aux>=0)
{
fout << n-aux << ' ';
k-=aux;
aux--;
}
fout << n-k << ' ';
for(int i=n;i>=n-aux;i--)
{
if(i!=n-k)
fout << i << ' ';
}
return 0;
}