Pagini recente » Cod sursa (job #250770) | Cod sursa (job #3255834) | Cod sursa (job #2460062) | Cod sursa (job #2772608) | Cod sursa (job #3134199)
#include <fstream>
long long n, m;
long long x = 2, k, d;
std::ifstream in("farfurii.in");
std::ofstream out("farfurii.out");
int main()
{
long long n, m;
in >> n >> m;
while (x * (x - 1) / 2 < m)
x++;
for (int i = 1; i <= n - x; i++)
out << i << " ";
k = n - (x * (x - 1) / 2 - m);
d = x;
d += n;
out << k << " ";
for (int i = n; i > k; i--)
out << i << " ";
for (int i = k - 1; i > d; i--)
out << i << " ";
}