洛谷P1706 全排列问题进阶解法

#include<cstdio>
#include<algorithm>

using namespace std;
int num[11] = { 1,2,3,4,5,6,7,8,9,10 };

int main()
{
	int N, i;
	scanf("%d", &N);
	do
	{
		for (i = 0; i < N; i++)
			printf("%5d", num[i]);
		printf("\n");
	} while (next_permutation(num, num + N));
	return 0;
}