1. problem : https://www.acmicpc.net/problem/15663 2. solution 1 :#include using namespace std;int N, M;int ans[8];int nums[8];bool isUsed[8];void backTrack(int k) { if (k == M) { for (int i = 0; i 0 && nums[i] == nums[i - 1] && !isUsed[i - 1]) { // i-1가 안쓰인다면 continue; // 중복된 경우 건너뛰기 } if (!isUsed[i]) { isUsed[i] = 1; ans[k] = nums[i]; backTrack(k + 1); isUsed[i] = 0; } }}int ma..

1. problem :https://www.acmicpc.net/problem/15657 2. solution 1 :#include using namespace std;int N, M;int nums[8];int ans[8];void backTrack(int k) { if (k == M) { for (int i = 0; i > N >> M; for (int i = 0; i > nums[i]; sort(nums, nums + N); backTrack(0);}

1. problem :https://www.acmicpc.net/problem/15656  2. solution 1 :#include using namespace std;int ans[8];int nums[8];int N, M;void backTrack(int k) { if (k == M) { for (int i = 0; i > N >> M; for (int i = 0; i > nums[i]; sort(nums, nums + N); backTrack(0);}

1. problem : https://www.acmicpc.net/problem/15655 2. solution 1 :#include using namespace std;int arr[10];int isUsed[10];int ans[10];int N, M;void backTrack(int k,int prev_val) { if (k == M) { for (int i = 0; i > N >> M; for (int i = 0; i > arr[i]; sort(arr, arr + N); backTrack(0, 0);} 3. solution 2 :// Authored by : BaaaaaaaaaaarkingDog// Co-authored by : -// http://boj.kr/19fa292ed77f4bd48c..

1. problem :https://www.acmicpc.net/problem/15654  2. solution 1 :#include using namespace std;int N, M;int arr[8];int ans[8];int isUsed[8] = { 0 };void backTrack(int k) { if (k == M) { for (int i = 0; i > N >> M; for (int i = 0; i > arr[i]; } sort(arr, arr + N); backTrack(0); return 0;}isUsed를 전역변수로 설정하였으면, 초기화가 자동으로 0으로 할당된다. 따라서, 따로 초기화 필요 없다.

1. problem :https://www.acmicpc.net/problem/15652  2. solution 1 :#include using namespace std;int N, M;int ans[8];void backTrack(int k) { if (k == M) { for (int i = 0; i > N >> M; backTrack(0);}