Pagini recente » Cod sursa (job #2157694) | Cod sursa (job #499908) | Cod sursa (job #2850999) | Cod sursa (job #3279474) | Cod sursa (job #1494016)
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
unsigned long long n,k,x,y,i,p;
int main()
{
f >> n >> k;
while(p * (p + 1) <= 2 * k)
++p;
--p;
x = p * (p + 1) / 2;
for(int i = 1 ; i <= n - p - 2 ; ++i)
g << i << " ";
y = n - p - 1 + k - x;
g << y << " ";
for(int i = n ; i >= n - p - 1 ; --i)
if(i != y)
g << i << " ";
return 0;
}