Pagini recente » Borderou de evaluare (job #1599929) | Cod sursa (job #1716371) | Cod sursa (job #2716060) | Cod sursa (job #1794022) | Cod sursa (job #2241966)
#include <fstream>
using namespace std;
ifstream fin ("farfurii.in");
ofstream fout ("farfurii.out");
long long N, k, i, p;
long long t;
int main()
{
fin>>N>>k;
t = 1;
while (t*(t-1)/2 < k)
t++;
for (i=1; i<=N-t; i++)
fout<<i<<" ";
p = N + k - t*(t-1)/2;
fout<<p<<" ";
for (i=N; i> N - t; i--)
if (i!=p)
fout<<i<<" ";
fout<<"\n";
return 0;
}