Pagini recente » Cod sursa (job #2758600) | Cod sursa (job #290408) | Cod sursa (job #3174454) | Cod sursa (job #1327222) | Cod sursa (job #1795133)
#include <fstream>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
long long a,b,n,i,x;
int main()
{
fin>>a>>b;
while(n*(n+1)/2<=b)
{
n++;
}
x=b-n*(n-1)/2;
if(x==0)
{
for(i=1;i<=a-n;i++)
fout<<i<<" ";
for(i=a;i>a-n;i--)
fout<<i<<" ";
}
else
{
for(i=1;i<a-n;i++)
fout<<i<<" ";
fout<<n+x-1<<" ";
for(i=a;i>=n+x;i--)
fout<<i<<" ";
for(i=n+x-2;i>=a-n;i--)
fout<<i<<" ";
}
return 0;
}