Pagini recente » Cod sursa (job #3234714) | Cod sursa (job #1653961) | Cod sursa (job #1668185) | Cod sursa (job #2712514) | Cod sursa (job #1074026)
#include <fstream>
using namespace std;
ifstream cin("farfurii.in");
ofstream cout("farfurii.out");
const int n_max=100001;
int n, k, x, i, r, j, v[n_max], y;
bool viz[n_max];
int main()
{
cin>>n>>k;
x=1;
for(i=1; i<=n; i++)
{
r=(n-i)*(n-i-1)/2;
j=0;
y=0;
while(r+j-y<k || viz[x+j])
{
if(viz[x+j]) y++;
j++;
}
v[i]=x+j;
viz[v[i]]=1;
k-=j-y;
while(viz[x]) x++;
}
for(i=1; i<=n; i++) cout<<v[i]<<" ";
return 0;
}