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