Pagini recente » Cod sursa (job #2785682) | Cod sursa (job #3185328) | Cod sursa (job #188050) | Cod sursa (job #1763381) | Cod sursa (job #254441)
Cod sursa(job #254441)
#include<stdio.h>
long n,p[50];
long double k;
long double fact[50];
int main()
{int i,j;
FILE *f=freopen("planeta.in","rt",stdin),*g=freopen("planeta.out","wt",stdout);
scanf("%ld %Lf",&n,&k);
k--;
fact[0]=1;
for(i=1;i<=n;i++) fact[i]=i*fact[i-1];
for(i=1;i<=n;i++)
{
p[i]=k/fact[n-i]+1;
k-=(p[i]-1)*fact[n-i];
}
for(i=n-1;i>=1;i--)
for(j=i+1;j<=n;j++)
if(p[j]>=p[i]) p[j]++;
for(i=1;i<=n;i++) printf("%ld ",p[i]);
return 0;
}