Pagini recente » Cod sursa (job #2202606) | Cod sursa (job #2108802) | Cod sursa (job #2900016) | Cod sursa (job #2980131) | Cod sursa (job #2904648)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long long v[800001],n, k, z, p, i, j, d;
int main()
{
f>>n>>k;
p = 0;
while( p * (p + 1)/2 < k) p++;
for(i = 1;i < n - p; i++)
g<<i<<" ";
d = p * (p + 1)/2 - k;
g<<n-d<<" ";
d = n-d;
for(j = n;j >= n - p; j--)
if(j!=d) g<<j<<" ";
return 0;
}