Pagini recente » Cod sursa (job #2284480) | Cod sursa (job #2615948) | Cod sursa (job #2201071) | Cod sursa (job #1466045) | Cod sursa (job #859211)
Cod sursa(job #859211)
#include <fstream>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
long n, j,r,i,t;
long long m,p;
int main()
{
fin>>n>>m;
for(i=1;i<=n;i++)
{
p=p+i;
if(p>=m)
{
j=i;
break;
}
}
r =((j+1)*j)/2-m;
for(i=1;i<=n-1-j;i++)
fout<<i<<" ";
t=n-r;
fout<<t<<" ";
for(i=n;i>=n-j;i--)
if(i!=t) fout<<i<<" ";
return 0;
}