1. problem : https://www.acmicpc.net/problem/16987 2. solution 1 :#include using namespace std;int eggs[8][2];bool isBroken[8]; int N;int maxCount;void backTrack(int current_pos) { if (current_pos == N) { int count = 0; for (int i = 0; i > N; for (int i = 0; i > eggs[i][j]; } backTrack(0); cout   3. solution 2 :// Authored by : BaaaaaaaaaaarkingDog// Co-authored by : -// http://boj.kr/550e5f94..

1. problem :https://www.acmicpc.net/problem/1941 2. solution 1 :// Authored by : heheHwang// Co-authored by : BaaaaaaaaaaarkingDog// http://boj.kr/b318d03bfd694a57be91322ff1dcd4ef#include using namespace std;bool mask[25];string board[5];int ans;int dx[4] = {1, 0, -1, 0};int dy[4] = {0, 1, 0, -1};int main(void) { ios::sync_with_stdio(0); cin.tie(0); for (int i = 0; i > board[i]; // 25명중 칠공주가..

1. problem : https://www.acmicpc.net/problem/6603 2. solution 1 :#include using namespace std;int k;int s[13];int ans[6];void backTrack(int a) { if (a == 6) { for (int i = 0; i > k; if (k == 0) break; for (int i = 0; i > s[i]; backTrack(0); cout  3. solution 2 :// Authored by : heheHwang// Co-authored by : -// http://boj.kr/2b87ad6475bc4dd0b42d5127c9524d8e#include using namespace std;int k,..

1. problem : https://www.acmicpc.net/problem/15666  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 chk(10002);int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> N >> M; int idx = 0; while (N--) { cin >> nums[idx]; if (chk[nums[idx]]) continue; chk[nums[idx]] = true; idx++; } N = idx; sort(nums,..

1. problem : https://www.acmicpc.net/problem/15665 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);} 3. solution 2 :// Authored by : hehehHwang// Co-authored by : BaaaaaaaaaaarkingDog// http://boj.kr/6cbf128678584f43997ee80f12913aa3#inclu..

1. problem :https://www.acmicpc.net/problem/15664  2. solution 1 :#include using namespace std;int N, M;int nums[8];int ans[8];bool isUsed[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);} 3. solution 2:// Authored by : connieya// Co-authored by : BaaaaaaaaaaarkingDog// http://boj.kr/7c17e31c609d4010ad339cec1f..