Pagini recente » Cod sursa (job #2452358) | Cod sursa (job #2856351) | Cod sursa (job #3260337) | Cod sursa (job #1054918) | Cod sursa (job #2754982)
#include <fstream>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
int main()
{
long long N, K;
fin >> N >> K;
long long m = 1;
while ((m * (m - 1) / 2) < K) ++m;
if (K == (m * (m - 1)) / 2)
{
for (int i = 1; i <= N - m; ++i) fout << i << " ";
for (int i = N; i >= N - m + 1; --i) fout << i << " ";
return 0;
}
--m;
for (int i = 1; i <= N - m - 1; ++i) fout << i << " ";
fout << N - (((m) * (m + 1)) / 2) + K << " ";
for (int i = N; i >= N - m; --i)
if (i != N - (((m) * (m + 1)) / 2) + K) fout << i << " ";
return 0;
}