히더

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWIeUtVakTMDFAVH #include #include #include using namespace std; int N, result, total;int map[16][16];bool check[16]; int cal(vector &v){ int tmp = 0; for (int i = 0; i < total;i++) for (int j = 0; j < total; j++) {if (i == j) continue; tmp += map[v[i]][v[j]];} return tmp;} int sin(){ vector a; vector b; for (i..

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5V4A46AdIDFAWuSWEA::2115::벌꿀채취 #include #include #include using namespace std; int t, n, m, c;int map[10][10];int d[10][10]; //최대값 계산하기int calc(vector &v, int n, int sum, int val) { if (sum > c) return 0; if (n == v.size()) return val; return max(calc(v, n + 1, sum + v[n], val + v[n] * v[n]), calc(v, n + 1, s..

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do #include #include using namespace std; #define INF 2e9 int N, numMAX, numMIN, tmp, tmp2;int op[4], arr[12]; void dfs(int num, int count){ if (count == N - 1) { numMAX = max(numMAX, tmp); numMIN = min(numMIN, tmp); return; } for (int i = 0; i 0) { if (i == 0) { tmp = num + arr[count + 1]; op[i]--;dfs(t..