欧拉计划 第二十四题

A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation of the digits 1, 2, 3 and 4. If all of the permutations are listed numerically or alphabetically, we call it lexicographic order. The lexicographic permutations of 0, 1 and 2 are:

012 021 102 120 201 210

What is the millionth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9?

置换是对象的有序排列。例如，3124是数字1,2,3和4的一种可能的排列。如果所有排列都以数字或字母顺序列出，我们称之为词典顺序。词典排列0,1和2是：

012 021 102 120 201 210

数字0,1,2,3,4,5,6,7,8和9的第一百万个词典排列是多少？

#include <stdio.h>

int get_num(int n, int *num, int delta){
	int rank = n / delta + 1, now = 0;
	for(int i = 0; i < 10; i++){
		now += !(num[i]);
		if(now == rank) return i;
	}
	return -1;
}
int main(){
	int n = 999999, delta = 362880;//初始为0123456789，所以只需便利999999次即可，delta=9!;
	int num[10] = {0};
	for(int i = 0; i < 10; i++){
		int digit = get_num(n, num, delta);
		printf("%d", digit);  //找到第i个数字
		num[digit] = 1;       //将已经用过的数字标记为1；
		n %= delta;           //还需要排列的次数；
		if(i == 9) break;     //如果i=9，已经不用再除1！,不然会有除0的现象；
		delta /= (9 - i);     //确定下一位的增量；
	}
	return 0;
}