알고리즘 문제 풀이/1DP_과제(~180615)
180414_2098_외판원 순회
//https://www.acmicpc.net/problem/2098 #include #define MAX 17000000using namespace std; int w[16][16];int dp[1N; for(int i=0; iw[i][j]; int ans = solve(0,0); cout
