Pagini recente » Cod sursa (job #1220078) | Cod sursa (job #1336512) | Cod sursa (job #2607037) | Cod sursa (job #2906186) | Cod sursa (job #2710595)
#include <fstream>
using namespace std;
ifstream cin("farfurii.in");
ofstream cout("farfurii.out");
int main()
{
int N, K, i, p, q;
cin >> N >> K;
if (K != 0)
{
p = 1;
while ((N - p - 1) * (N - p) > 2 * K) ++p;
for (i = 1; i < p; ++i)
cout << i << ' ';
q = 1;
while ((N - p - 1) * (N - p) != 2 * (K - q)) ++q;
cout << p + q << ' ';
for (i = N; i >= p; --i)
if (i != p + q) cout << i << ' ';
}
else
{
for (i = 1; i <= N; ++i)
cout << i << ' ';
}
return 0;
}