Pagini recente » Cod sursa (job #2877743) | Cod sursa (job #2778744) | Cod sursa (job #241580) | Cod sursa (job #2953598) | Cod sursa (job #1081430)
#include <fstream>
using namespace std;
ifstream in("farfurii.in");
ofstream out("farfurii.out");
const int NMAX = 100002;
int V[NMAX];
long long N, K;
int main()
{
int i, last;
long long value;
in >> N >> K;
for (value = 1; value * (value + 1) / 2 <= K; value++);
value--; //decrementing
K -= value * (value + 1) / 2;
value = N - value;
last = value - 1 + K;
for (i = 1; i <= value - 2; i++)
out << i << ' ';
if (value != 1)
out << last << ' ';
out << N << ' ';
for (i = N - 1; i >= value - 1; i--)
if (i != last)
out << i << ' ';
}