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