P1706 全排列问题

#include <iostream>
#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <deque>
#include <array>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <cmath>
#include <cstdio>
#include <climits>
#include <string>
#include <cstring>
#include <cctype>
#include <cassert>
#include <cstdbool>

using namespace std;
const double PI = acos(-1);

const int INF = 0x3fffffff; //更常用
//memset(arr, 0x7f, sizeof arr); //浮点数的正无穷大，这个有用
//memset(arr, 0x3f, sizeof arr);//每个元素赋值成0x3f3f3f3f，即1061109567，通常看成int的无穷大
struct cmp {
    bool operator()(int a, int b) {
          return a > b;
    }
};
//自定义数据结构,优先队列
struct te {
    int x;

    te(int a) {
          x = a;
    };

    bool operator<(const te &a) const {
          return x < a.x;//大顶堆
    }
};
template<class T>
int length(T &array) {
      return sizeof(array) / sizeof(array[0]);
}

bool is_prime[100007];

void ai() {
      for (int i = 2; i <= 100000; i++) {
            is_prime[i] = 1;
      }
      for (int i = 2; i <= 100000; i++) {
            if (is_prime[i]) {
                  for (int j = 2 * i; j <= 100000; j += i) {
                        is_prime[j] = 0;
                  }
            }
      }
}

int numberInversion(int x) {
      int num = 0;
      while (x != 0) {
            num = num * 10 + x % 10;
            x /= 10;
      }
      return num;
}

double half(double x) {
      return x / 2;
}

string half(string s) {
      int n = s.length() / 2;
      char *str = new char[n];
      for (int i = 0; i < n; i++) {
            str[i] = s[i];
      }
      return str;
}

//字符串反转并删除前导0
string reverse(string s) {
      int cnt = 0;
      reverse(s.begin(), s.end());
      for (auto i: s) {
            if (i == '0') {
                  cnt++;
            } else {
                  break;
            }
      }
      s.erase(s.begin(), s.begin() + cnt);
      return (s != "" ? s : "0");
}

//删除后导零
string deleteTail(string s) {
      int cnt = 0;
      for (int i = s.length() - 1; i >= 0; i--) {
            if (s[i] == '0') {
                  cnt++;
            } else {
                  break;
            }
      }
      s.erase(s.end() - cnt, s.end());
      return (s != "" ? s : "0");
}

bool is_leap(int year) {
      return (year % 4 == 0 && year % 100 != 0) || (year % 400 == 0);
}
//全排列
//int n, arr[10];

void dfs(int start, int end) {
      if (start == end) {
            for (int i = 0; i < n; i++) {
                  printf("%5d",arr[i]);
            }
            printf("\n");
            return;
      }
      for (int i = start; i <= end; i++) {
            swap(arr[i], arr[start]); //两个数交换
            dfs(start + 1, end); //s
            swap(arr[i], arr[start]);
      }
}
int n, arr[10] ;
int main() {
           scanf("%d",&n);
      for(int i=0;i<n;i++){//赋值
            arr[i]=i+1;
      }
      sort(arr,arr+n);//其实可以不用,但是套路
      do{
            for(int i=0;i<n;i++){
                  printf("%5d",arr[i]);
            }
            printf("\n");
      } while (next_permutation(arr,arr+n));
	
      return 0;
}