알고리즘 문제 풀이/1DP_과제(~180615)
180423_1003_피보나치 함수
//https://www.acmicpc.net/problem/1003 #include using namespace std; int dp[41][2];int main(){ int n; cin >> n; dp[0][0]=1; dp[1][1]=1; for(int i=2; i
dp
알고리즘 문제 풀이/1DP_과제(~180615)
180423_2747_피보나치 수
//https://www.acmicpc.net/problem/2747 #include using namespace std; void memoization(int f[]);int search(int f[], int n);int main(){ int f[45]; memoization(f); int n; cin >> n; cout
알고리즘 문제 풀이/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
알고리즘 문제 풀이/1DP_과제(~180615)
180405_14501_퇴사
//https://www.acmicpc.net/problem/14501 #include #include using namespace std; int N; int counsel[16][2];int dp[16]; void input();void solve(int today, int earn); int main(){ cin >> N; input(); solve(counsel[1][0], counsel[1][1]); solve(1, 0); cout counsel[i][0] >> counsel[i][1];} void solve(int today, int earn){ if(today=N){ return; } solve(today+counsel[today+1][0], earn+counsel[today+1][1]); ..
