Pagini recente » Cod sursa (job #99396) | Cod sursa (job #3277705) | Cod sursa (job #1565070) | Cod sursa (job #376482) | Cod sursa (job #2233569)
#include <cstdio>
using namespace std;
int main()
{
freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
int n(0), m(0);
scanf("%d %d",&n,&m);
int nrLipsa(0);
long long operatii(0);
long long operatii2(0);
if ((n * (n - 1)) / 2 != m)
for (int i = 1 ; i <= n ; i++)
{
operatii = ((n - i + 1) * (n - i)) / 2;
operatii2 = ((n - i) * (n - i - 1)) / 2;
if (operatii > m && operatii2 > m)
{
printf("%d ",i);
}
else
{
printf("%d ",m - operatii2 + i);
for (int j = n ; j >= i ; j--)
if (j != m - operatii2 + i)
printf("%d ",j);
i = n + 1;
}
}
else
for (int i = n ; i >= 1 ; i--)
printf("%d ",i);
return 0;
}