[Dynamic Programming]Example 3.1.2-Permutation of Number Sequence

//国际大学生程序设计竞赛例题解（三）

 //动态规划 

//Page106

///例题3.1.2

#include <iostream>
#include <cstdio>

using namespace std;

void swap(int &x, int &y)
{
    int temp = x;
    x = y;
    y = temp;
}

int n;
int data[100];

void solve(int t)
{
    if(t == n)
    {
        for(int i = 1; i<= n; i++)
        {
            cout << data[i] << ' ';
        }
        cout << endl;
        return;
    }
    for(int i = t; i <= n; i++)
    {
        swap(data[i], data[t]);
        solve(t + 1);
        swap(data[i], data[t]);
    }
}

int main()
{
    cin >> n;
    for(int i = 1; i <= n; i++)
    {
        data[i] = i;
    }
    solve(1);
    return 0;
}