Pagini recente » Cod sursa (job #2660533) | Cod sursa (job #1051945) | Cod sursa (job #2915354) | Cod sursa (job #2652518) | Cod sursa (job #3134195)
#include <fstream>
#include <iostream>
using namespace std;
int main()
{
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long N, K;
f >> N >> K;
long cnt = 1;
while ((N - cnt) * (N - cnt - 1) / 2 > K)
{
g << " " << cnt;
cnt++;
}
long dif = K - ((N - cnt) * (N - cnt - 1) / 2);
g << " " << dif + cnt;
for (long j = N; j >= cnt; j--)
{
if (j != cnt + dif)
g << " " << j;
}
f.close();
g.close();
return 0;
}