Pagini recente » Cod sursa (job #2938621) | Cod sursa (job #249590) | Cod sursa (job #167152) | Cod sursa (job #2549719) | Cod sursa (job #2506733)
#include<fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long long v[100005];
long long n,k,i,j,s,x,cnt;
int main()
{
f>>n>>k;
cnt=n;
for(i=1;i<=n;i++)
{
s=(n-i)*(n-i+1)/2;
if(s>=k)
v[i]=i;
else
{
v[i-1]=(i-1)+k-s;
x=v[i-1];
break;
}
}
for(j=1;j<i;j++)
g<<v[j]<<" ";
for(;i<=n;i++)
{
if(cnt==x)
cnt--;
g<<cnt<<" ";
cnt--;
}
return 0;
}