Pagini recente » Cod sursa (job #2108072) | Cod sursa (job #1970133) | Cod sursa (job #1698538) | Cod sursa (job #2227692) | Cod sursa (job #1458631)
#include <fstream>
using namespace std;
int main()
{
long long n, k;
long long p;
int special;
int i;
ifstream f("farfurii.in");
f >> n >> k;
f.close();
p = 0;
while((p * (p - 1)) / 2 < k)
p++;
special = n - (p * (p - 1)) / 2 + k;
ofstream g("farfurii.out");
for(i = 1; i < n - p + 1; i++)
g << i << " ";
if(special >= n - p + 1)
g << special << " ";
for(i = n; i > special; i--)
g << i << " ";
for(i = special - 1; i >= n - p + 1; i--)
g << i << " ";
g.close();
return 0;
}