코드1 (next_permutaion 사용)#include #include using namespace std;int n, a[10], res;int main() { cin >> n; for (int i = 0; i > a[i]; sort(a, a + n); do { int tmp = 0; for (int i = 0; i 코드2 (순열 구현)#include using namespace std;int n, a[10], res;void permutation(int n, int r, int depth) { if (r == depth) { int tmp = 0; for (int i = 0; i > n; for (int i = 0; i > a[i]; permutation(n, n, 0); cout 풀이n의..
