Pagini recente » Cod sursa (job #1134076) | Cod sursa (job #322053) | Cod sursa (job #3192476) | Cod sursa (job #2147364) | Cod sursa (job #1583624)
#include <fstream>
using namespace std;
#define Nmax 100001
int main()
{
int i;
long long m, n, k, dif, nr;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
fin >> n >> k;
fin.close();
for(m = 1; (m + 1) * m / 2 <= k; ++m) ;
dif = m * (m + 1) / 2 - k;
// m(m-1) / 2 <= k
for(i = 1; i <= n - m - 1; ++i) fout << i << ' ';
fout << n - dif << ' ';
for(nr = n, ++i; i <= n; --nr, ++i)
{
if(nr == n - dif) --nr;
fout << nr << ' ';
}
fout.close();
return 0;
}