10974번: 모든 순열

#include<cstdio>

#include<algorithm>

int s[8];

int main()

{

int n;

scanf("%d", &n);

for (int i = 0; i < n; ++i)

s[i] = i + 1;

do 

{

for (int i = 0; i < n; ++i)

printf("%d ", s[i]);

printf("\n");

} while (std::next_permutation(&s[0], &s[n]));

}