히더

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do #include #include using namespace std; #define MAX_N 9 int N, K, result, max_num;int map[MAX_N][MAX_N];bool check[MAX_N][MAX_N], used;int dir[4][2] = { { 1,0 },{ -1,0 },{ 0,1 },{ 0,-1 } }; void dfs(int i, int j, int count){ for (int d = 0; d = 0 && ..

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWIeW7FakkUDFAVH #include #include using namespace std; #define MAX_N 20 int i, j, N, X, K, cnt, result;int ga[MAX_N][MAX_N], se[MAX_N][MAX_N];bool visited[MAX_N][MAX_N], check; void input(){ int tmp; result = 0; cin >> N >> X; for (i = 0;i > tmp; ga[i][j] = tmp; se[j][i] =..

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do #include #include using namespace std; int i, j, K, result;int a[4][8]; int ro[40][2]; int check[4][2]; void rotation(int i, int wh){ int tmp; if (wh == 1) { tmp = a[i][1]; a[i][1] = a[i][0]; for (j = 2;j = ..

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWHPkqBqAEsDFAUn #include #include using namespace std; #define MAX_N 101#define MAX_M 10000 int i, j, N, result;int a[MAX_N], check[MAX_M]; void input(){ cin >> N; for (i = 1;i > a[i]; for (i = 0;i 0 && j+a[i]> T; while (T--) { input(); cal(); cout

출처 : 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

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

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

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