kingsubin

import java.io.*;
 
public class boj_10974 {
    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
    static int N;
    static int[] a;
 
    public static void main(String[] args) throws IOException {
        N = Integer.parseInt(br.readLine());
        a = new int[N];
 
        for (int i = 0; i < N; i++) {
            a[i] = i+1;
        }
 
        do {
            for (int i = 0; i < N; i++) {
                bw.write(a[i] + " ");
            }
            bw.newLine();
        } while (next_permutation(a, N)) ;
 
        bw.flush();
        bw.close();
    }
 
    static boolean next_permutation(int[] a, int n) {
        int i = n-1;
        while (i > 0 && a[i-1] >= a[i]) i-=1;
        if (i <= 0) return false;
 
        int j = n-1;
        while (a[j] <= a[i-1]) j-=1;
 
        int temp = a[i-1];
        a[i-1] = a[j];
        a[j] = temp;
 
        j = n-1;
        while (i < j) {
            temp = a[i];
            a[i] = a[j];
            a[j] = temp;
            i += 1; j -= 1;
        }
        return true;
    }
}
 

 

- 수학, 브루트포스

 

- next_permutation 함수로 처음부터 돌리면 됨

 

 

 

 

---

www.acmicpc.net/problem/10974