Pagini recente » Cod sursa (job #1994713) | Cod sursa (job #2218992) | Cod sursa (job #1295336) | Cod sursa (job #2802789) | Cod sursa (job #2754206)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long n,m,poz,inv,k;
int main()
{
f>>n>>m;
k=1;
while(k*(k+1)/2 <= m){
k++;
}
poz = n-k;
for(int i=1; i<poz; i++){
g<<i<<" ";
}
inv = poz+m-(k*(k-1)/2);
g<<inv<<" ";
for(int i=n; i>inv; i--){
g<<i<<" ";
}
for(int i = inv-1; i>poz-1; i--){
g<<i<<" ";
}
return 0;
}