回复 10楼 lz1091914999
这个 不错 如果排列前给个序号就圆满了。
梅尚程荀
马谭杨奚
程序代码：#include<stdio.h>
void print_permutation(int n, int deep, int max)
{
static int * p, c;
int i, j, t;
if(deep == 0)
{
p = (int *)malloc(n * sizeof(int));
for(i = 0; i < n; i++) p[i] = i + 1;
c = 0;
}
if(deep >= n)
{
printf("%4d : ", ++c);
for(i = 0; i < n; printf("%-4d", p[i++]));
puts("");
return;
}
for(i = deep; i < n && c < max; i++)
{
t = p[deep]; p[deep] = p[i]; p[i] = t;
print_permutation(n, deep + 1, max);
}
for(t = p[i = deep]; i < n - 1; i++) p[i] = p[i + 1];
p[n - 1] = t;
if(deep == 0) free(p);
}
int main()
{
int n;
while(scanf("%d", &n), n) print_permutation(n, 0, 200);
return 0;
}
