Pagini recente » Cod sursa (job #1661833) | Cod sursa (job #589140) | Cod sursa (job #1750091) | Cod sursa (job #2539599) | Cod sursa (job #254285)
Cod sursa(job #254285)
#include<cstdio>
#include<algorithm>
using namespace std;
long long a[32],i,j,n,k,kappa;
int main()
{ freopen("planeta.in","r",stdin);
freopen("planeta.out","w",stdout);
scanf("%lld%lld",&n,&k);
for(i=n/2,j=1;i>=1;i--,j++) a[j]=i;
for(i=j,j=n/2+1;j<=n;i++,j++)a[i]=j;
do
{ kappa++;
if(k==kappa)
{ for(i=1;i<=n;i++)
printf("%lld ",a[i]);
return 0;
}
}
while(next_permutation(a+1,a+n+1));
return 0;
}