[알고리즘] 백준 17974번: 모든 순열 - C++

www.acmicpc.net/problem/10974

10974번: 모든 순열

#include <cstdio>
#include <algorithm>
using namespace std;

int main() {
	int N;
	int *a;
	scanf("%d", &N);
	a = (int *)malloc(sizeof(int)*N);
	for (int i = 0; i < N; i++) {
		a[i] = i + 1;
		printf("%d ", a[i]);
	}
	printf("\n");
	while (next_permutation(a, a + N)) {
		for (int i = 0; i < N; i++) {
			printf("%d ", a[i]);
		}
		printf("\n");
	}
}

 

github: github.com/waves123/10974/blob/master/10974/10974.cpp

waves123/10974