Pagini recente » Cod sursa (job #1598429) | Cod sursa (job #3293254) | Cod sursa (job #1130404) | Cod sursa (job #2379680) | Cod sursa (job #2902005)
#include <fstream>
int combinari_n_2 (const int &n) {
return n * (n - 1) >> 1;
}
int main()
{
std::ifstream fin("farfurii.in");
std::ofstream fout("farfurii.out");
int n;
long long k;
fin >> n >> k;
int split = 1;
while (combinari_n_2(split) < k) ++split;
for (int i = 1; i <= n - split; ++i) fout << i << " ";
int aux = n - combinari_n_2(split) + k;
fout << aux << " ";
for (int i = n; i > n - split; --i)
if (i != aux) fout << i << " ";
return 0;
}