Pagini recente » Cod sursa (job #2333948) | Cod sursa (job #1013755) | Cod sursa (job #1362885) | Cod sursa (job #1875212) | Cod sursa (job #2311833)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long long n,k,m,x,i;
int main()
{
f>>n>>k;
m=1;
while(m*(m-1)/2<k)
{
m++;
}
if(k==m*(m-1)/2)
{
for(i=1;i<=n-m;i++)
{
g<<i<<" ";
}
for(i=n;i>=n-m+1;i--)
{
g<<i<<" ";
}
}
else
{
m--;
x=n-(m*(m+1)/2-k);
for(i=1;i<=n-m-1;i++)
{
g<<i<<" ";
}
g<<x<<" ";
for(i=n;i>=n-m;i--)
{
if(i!=x)
{
g<<i<<" ";
}
}
}
return 0;
}