Pagini recente » Cod sursa (job #271290) | Cod sursa (job #2684968) | Cod sursa (job #3152124) | Cod sursa (job #2872045) | Cod sursa (job #2634640)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
int main()
{
int n, m;
fin >> n >> m;
int k;
for (int i = 1;i <= n;++i)
if (i * (i - 1) / 2 >= m) {
k = i;
break;
}
int x = (n - k + 1) + m - (k - 1) * (k - 2) / 2;
for (int i = 1;i <= n - k;++i)
fout << i << ' ';
fout << x << ' ';
for (int i = n;i > n - k;--i)
if (i == x) continue;
else fout << i << ' ';
return 0;
}