Pagini recente » Cod sursa (job #2312097) | Cod sursa (job #2826191) | Cod sursa (job #2318719) | Cod sursa (job #854199) | Cod sursa (job #2548465)
#include <fstream>
#include <iostream>
using namespace std;
ifstream in ("farfurii.in");
ofstream out ("farfurii.out");
int main()
{
long long n,k,val=0,q=0;
in>>n>>k;
for(int i=1;i<=n;++i)
{
long long r=n-i;
if(r*(r-1)/2>k)
out<<i<<' ';
else
{
val=i+(k-r*(r-1)/2);
q=i+1;
out<<val<<' ';
break;
}
}
k=n;
for(int i=q;i<=n;++i)
{
if(k==val)
--k;
out<<k<<' ';
--k;
}
return 0;
}