Pagini recente » Cod sursa (job #2401923) | Cod sursa (job #2388083) | Cod sursa (job #64483) | Cod sursa (job #230997) | Cod sursa (job #2049278)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long long n,k;
long long a[100010],b[100010],i ,aux, t;
int main()
{
f>>n>>k;
for (i=1;i<=n;i++) a[i]=i;
aux=n+1;
t=1;
while (t*(t-1)/2<k)
t++;
t=n-t;
for (i=1;i<=t;i++) g<<i<<" ";
t++;
long long nr=k-(t)*(t-1)/2;
g<<nr<<" ";
for(i=n;i>=t;i--) if (i!=nr) g<<i<<" ";
return 0;
}