Pagini recente » Cod sursa (job #2504635) | Cod sursa (job #2157702) | Cod sursa (job #2747826) | Cod sursa (job #161102) | Cod sursa (job #1822096)
#include <fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long long n,k,i,j;
long long m,val;
int main()
{
f>>n>>k;
m=1;
while((m*(m+1))/2<k)
{
m++;
}
//g<<k<<" "<<(m*(m+1))/2<<"\n";
for(i=1;i<=n-m-1;i++)
{
g<<i<<" ";
}
val=n-m;
k=k-(m*(m+1))/2;
if(k==0)
{
for(i=n;i>=val;i--)
{
g<<i<<" ";
}
}
else
{
g<<k+n<<" ";
k=k+n;
for(i=n;i>=val;i--)
{
if(i!=k)
{
g<<i<<" ";
}
}
}
f.close();
g.close();
return 0;
}