히더

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5PpFQaAQMDFAUq #include #include using namespace std; int i, j, t, T, result;int d, m, m3, y;int dp[15]; void input(){ cin >> d >> m >> m3 >> y;} void cal(){ for (i = 3;i > dp[i]; dp[i] = min(min(dp[i - 1] + dp[i] * d, dp[i - 1] + m), dp[i - 3] + m3); } result = min(dp[14], y);} int main(){ cin >> T; t = 1; w..

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV4suNtaXFEDFAUf #include #include using namespace std; #define MAX_N 12 int i, j, N, T, t;int a[MAX_N][MAX_N],a2[MAX_N][MAX_N], result1, result2, d1, d2; void input(){ cin >> N; for (i = 0;i a[i][j]; for (i = 0;i < N;i++) for (j = 0;j < N;j++) a2[i][j] = a[i][j];} void cal1(){ int l, r, u, ..

출처 : https://www.acmicpc.net/problem/1463 1. dp를 이용해 계산한다. #include #include using namespace std; #define MAX_N 1000001int i, N, result;int dp[MAX_N]; void input(){ cin >> N;} void cal(){ dp[1] = 0; dp[2] = 1; dp[3] = 1; for (i = 4;i