Pagini recente » Cod sursa (job #2026740) | Istoria paginii utilizator/biiank | Cod sursa (job #381649) | Cod sursa (job #3215098) | Cod sursa (job #1900133)
#include <fstream>
using namespace std;
ifstream fin ("farfurii.in");
ofstream fout ("farfurii.out");
int main()
{
int n, k, i, j, p, nr, t;
fin>>n>>k;
nr=n-1;
for (i=1; i<=n; i++)
{
p=(nr-1)*nr/2;
if ((nr-2)*(nr-1)/2<k)
{
for (j=1; j<=i; j++)
fout<<j<<" ";
break;
}
nr--;
}
t=n-(p-k);
fout<<t<<" ";
for (j=n; j>i; j--)
if (j!=t)
fout<<j<<" ";
return 0;
}