Pagini recente » Cod sursa (job #1907548) | Cod sursa (job #597767) | Monitorul de evaluare | Cod sursa (job #1606835) | Cod sursa (job #516532)
Cod sursa(job #516532)
#include <iostream>
#include <fstream>
using namespace std;
const char iname[] = "farfurii.in";
const char oname[] = "farfurii.out";
using namespace std;
ifstream fin(iname);
ofstream fout(oname);
int ap[100005], n, k, i;
int main()
{
fin >> n >> k;
for(i = 1; i <= n; i ++)
{
if((n - i) * (n - i - 1) / 2 >= k && (n - i + 1) * (n - i) / 2 >= k)
{
fout << i << " ";
ap[i] = 1;
}
else
{
if(k - i >= 1 && ap[k - i] == 0)
{
fout << k - i << " ";
ap[k - i] = 1;
break;
}
}
}
for(i = n; i >= 1; i --)
if(ap[i] == 0)
fout << i << " ";
return 0;
}