Pagini recente » Cod sursa (job #1906831) | Cod sursa (job #51524) | Cod sursa (job #2067149) | Cod sursa (job #2314266) | Cod sursa (job #1074136)
#include <fstream>
using namespace std;
ifstream cin("farfurii.in");
ofstream cout("farfurii.out");
const int n_max=100001;
long long n, m, i, k, r, p;
int main()
{
cin>>n>>m;
k=1;
while(k*(k-1)/2<m) k++;
k--;
p=n-k;
r=m-k*(k-1)/2;
for(i=1; i<p; i++) cout<<i<<" ";
cout<<p+r<<" ";
for(i=n; i>p+r; i--) cout<<i<<" ";
for(i=p+r-1; i>=p; i--) cout<<i<<" ";
return 0;
}