1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"CodeViewer"] 1c:T4a4,#include using namespace std; int cost[16][16]; int dp[1<<16]; int main() { ios::sync_with_stdio(0);cin.tie(0); int n, p; cin >> n; for(int i=0; i> cost[i][j]; } } for(int i=0; i<(1<> st >> p; int init = 0, cnt = 0; for(int i=0; i= p) return !(cout << 0); if(!cnt) return !(cout << -1); dp[init] = 0; p -= cnt; queue que; que.push(init); int ans = 0; //printf("p = %d\n", p); while(p--) { ans = INT_MAX; int s = (int)que.size(); while(s--) { int bm = que.front(); que.pop(); vector onv, nov; for(int i=0; i

코드 #2589