모든 순열 - 10974

문제 : 

https://www.acmicpc.net/problem/10974

10974번: 모든 순열

 

소스 : 

#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
	int n;
	cin >> n;

	int num[8] = { 0 };
	for (int i = 0; i < n; i++)
	{
		num[i] = i + 1;
	}

	do
	{
		for (int i = 0; i < n; i++)
		{
			cout << num[i];
			if (i < n - 1)
				cout << " ";
		}
		cout << "\n";
	} while (next_permutation(num, &num[n]));

	return 0;
}