Pagini recente » Cod sursa (job #386367) | Cod sursa (job #2347631) | Cod sursa (job #1383098) | Cod sursa (job #1635680) | Cod sursa (job #2903192)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
int i,n,k,j,p;
int main()
{
i=1;
fin>>n>>k;
while(i*(i+1)/2<=k)
{
i++;
}
i--;
if((i+1)*i/2==k)
{
for(j=1;j<=n-i-1;j++)
fout<<j<<" ";
for(p=n;p>=n-i;p--)
fout<<p<<" ";
}
else
{
for(j=1;j<=n-i-2;j++)
fout<<j<<" ";
fout<<n-(i+1)*(i+2)/2+k<<" ";
for(p=n;p>=n-i;p--)
{
if(p>n-(i+1)*(i+2)/2+k)
fout<<p<<" ";
else{fout<<p-1<<" ";}
}
}
return 0;
}