Pagini recente » Cod sursa (job #3176187) | Cod sursa (job #1656000) | Cod sursa (job #1395668) | Cod sursa (job #1456726) | Cod sursa (job #678407)
Cod sursa(job #678407)
#include <fstream>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
long long n, k;
int V[100002], can, num;
int main()
{
int b,p;
fin>>n>>k;
for (p=1;p*(p+1)/2<=k;++p);
--p;
k-=p*(p+1)/2;
p=n-p;
b=p-1+k;
for (int i=1;i<=p-2;++i)
fout<<i<<' ';
if (p!=1)fout<<b<<' ';
fout<<n<<' ';
for (int i=n-1;i>=p-1;--i)
if (i!=b)
fout<<i<<' ';
fin.close();
fout.close();
}