Pagini recente » Cod sursa (job #1120020) | Cod sursa (job #910654) | Cod sursa (job #1092560) | Cod sursa (job #1356179) | Cod sursa (job #2128473)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int main()
{
ifstream cin("farfurii.in");
ofstream cout("farfurii.out");
int n,k,i;
cin>>n>>k;
long long s=0,p=1;
while(s+p<=k){
s+=p;
p++;
}
p--;
if(k==n*(n-1)/2){
for(i=n;i>=1;i--)
cout<<i<<" ";
return 0;
}
for(i=1;i<=n-p-2;i++){
cout<<i<<" ";
}
cout<<n-p-1+k-s<<" ";
for(i=n;i>n-p-2;i--){
if(i!=n-p-1+k-s)
cout<<i<<" ";
}
return 0;
}