Pagini recente » Cod sursa (job #1503689) | Cod sursa (job #19654) | Cod sursa (job #19661) | Cod sursa (job #348049) | Cod sursa (job #2752070)
#include <fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
int main()
{ long long K,N;
f >> 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) g << i << " "; for (int i = N; i >= N - m + 1; --i) g << i << " "; return 0; } --m; for (int i = 1; i <= N - m - 1; ++i)
g << i << " "; g << N - (((m) * (m + 1)) / 2) + K << " "; for (int i = N; i >= N - m; --i) if (i != N - (((m ) * (m + 1)) / 2) + K) g << i << " "; return 0;}