Pagini recente » Cod sursa (job #920961) | Cod sursa (job #751877) | Cod sursa (job #2337967) | Cod sursa (job #1982762) | Cod sursa (job #3134122)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
int main()
{
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 != dif + cnt)
g << j ;
}
return 0;
}