Pagini recente » Cod sursa (job #576917) | Cod sursa (job #299443) | Cod sursa (job #771324) | Cod sursa (job #484412) | Cod sursa (job #1626257)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin ("farfurii.in");
ofstream fout ("farfurii.out");
int N, K;
int main()
{
fin >>N >>K;
int m;
for(m = 1; (m + 1) * m / 2 <= K; ++m) ;
K -= m*(m-1)/2;
if (!K)
{
for (int i = 1; i <= N-m; ++i)
fout <<i <<' ';
for (int i = N; i > N-m; --i)
fout <<i <<' ';
fout <<'\n';
}
else
{
K = m - K;
++m;
for (int i = 1; i <= N-m; ++i)
fout <<i <<' ';
fout <<N-K <<' ';
for (int i = N; i > N-K; --i)
fout <<i <<' ';
for (int i = N - K - 1; i > N-m; --i)
fout <<i <<' ';
fout <<'\n';
}
return 0;
}