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