Pagini recente » Cod sursa (job #1777936) | Cod sursa (job #1816975) | Cod sursa (job #1818283) | Cod sursa (job #1579998) | Cod sursa (job #2858735)
#include <fstream>
#include <climits>
#include <iostream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
int n,k,v[135000];
int main()
{
int i=1,save,ok=1,c;
f>>n>>k;
while(ok)
{
if(((n-i)*(n-i+1)/2)>=k)
v[i]=i,i++;
else
{
v[i-1]=k-i+1;
save=k-i+1;
ok=0;
i--;
}
}
for(int j=1;j<=i;j++) g<<v[j]<<" ";
c=n;
for(int j=i;j<n;j++)
{
if(c==save)
c--;
g<<c--<<" ";
}
}