Pagini recente » Cod sursa (job #2430532) | Cod sursa (job #1411262) | Cod sursa (job #2767637) | Cod sursa (job #1092544) | Cod sursa (job #1900087)
#include <fstream>
using namespace std;
int n,k,i,x,y,v[100005];
int main()
{
ifstream f("farfurii.in");
ofstream g("farfurii.out");
f>>n>>k;
for(i=1; i<=n; i++) v[i]=i;
i=1;
while(i*(i-1)/2<=k) i++;
i--;
x=n-i;
y=x+k-i*(i-1)/2;
for(i=x+1; i<=y; i++) v[i]=i-1;
v[x]=y;
for(i=1; i<=n; i++)
{
if(i>=x+1&&i<=(n+x+1)/2) swap(v[i],v[n+x+1-i]);
g<<v[i]<<" ";
}
g<<'\n';
f.close(); g.close();
return 0;
}