Pagini recente » Borderou de evaluare (job #431377) | Cod sursa (job #1561022) | Cod sursa (job #2339457) | Cod sursa (job #2621305) | Cod sursa (job #1074817)
#include<fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long long n, k;
int main() {
long long i, suma = 0, start = 0, rest = 0;
f >> n >> k;
for (i = 1; i <= n; ++i) {
suma += i;
if (suma >= k) {
start = i;
break;
}
}
rest = ((start + 1) * start) / 2 - k;
for (i = 1; i <= n - start - 1; ++i)
g << i << " ";
g << n - rest << " ";
for (i = n; i >= n - start; --i)
if (i != n - rest)
g << i << " ";
f.close();
g.close();
return 0;
}