科迪
Let write some permutations of positive integers.
1: 1 2 3 4 5 6 ... 2: 2 1 3 4 ... 3: 1 3 2 4 ... 4: 2 3 1 4 ... 5: 3 1 2 4 ... 6: 3 2 1 4 ... 25: 1 2 3 5 4 ... 120: 5 4 3 2 1 6 7 ...
Given an index, find appropriate permutation and truncate sorted part on the right side.
example:
323: 3 5 1 6 4 2 7 8 9 10 ...
>> n = 323; >> whichperm(n) ans = 3 5 1 6 4
See also: 42494
解决方案1662695
巫师!
求和数字
6542求解器
解决Sudoku行
950 Solvers
按降序安排向量
6609求解器
Three...is a magic number.
67 Solvers
总结我的索引
128 Solvers
Which permutation is it?
13 Solvers
Polite numbers. N-th polite number.
137 Solvers
每个人的煎饼!
26个求解器
Prouhet–Tarry–Escott (basic)
7 Solvers
煎饼排序 - 最小翻转。
24 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
选择一个网站
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select:.
您还可以从以下列表中选择一个网站:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
联系您当地的办公室