Pagini recente » Cod sursa (job #242435) | Cod sursa (job #542018) | Cod sursa (job #2914818) | Cod sursa (job #3156920) | Cod sursa (job #2625472)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
int main()
{
long long n,k,tac,m;
fin>>n>>k;
tac=1;
long long var = tac*(tac-1)/2;
while(var<k)
{
tac++;
var = tac*(tac-1)/2;
}
tac=n-tac;
for(int i=1; i<=tac; i++)
fout<<i<<" ";
tac++;
m=(n-(n - tac)*n - tac + 1)/2+k;
fout<<m<<" ";
for(int i=n; i>=tac; i--)
{
if (i!=m)
{
fout<<i<<" ";}
}
return 0;
}