#include<cstdio>
const int maxn = 11;
//P 為當前排列 HashTable記錄整個數(shù)x是否已經(jīng)在P中
int n,P[maxn],hashTable[maxn] = {false};
//當前處理排列的第index位置
void generateP(int index) {
    if(index == n+1){
        for(int i=1;i<=n;i++){
            printf("%d",P[i]);
        }
        printf("\n");
        return ;
    }
    for(int x = 1;x<=n;x++) {
        if(hashTable[x] == false) {
            P[index] = x;
            hashTable[x] = true;
            generateP(index + 1);
            hashTable[x] = false;
        }
    }
}
int main()
{
    n = 3;
    generateP(1);
    return 0;

}