히더

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV14eWb6AAkCFAYD #include #include #include using namespace std; int N,result;int check[4]; int main(){int T; int t=1;T = 10;while (T--){cin >> N; result = 1;fill(check, check + 4, 0);for (int i = 0; i > c;if (c == '(') check[0] += 1;else if (c == ')') check[0] -= 1;else if (c == '[') che..

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV14dUIaAAUCFAYD& #include #include #include using namespace std; int a, b; int cal(int now){if (now == 1)return a;return (a * cal(now - 1));} int main(){int T; int t;T = 10;while (T--){cin >> t;cin >> a >> b; cout

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV14Rq5aABUCFAYi #include #include #include using namespace std; int result, N;char arr[100][100]; void cal(int i, int sj, int ej, int l){int zz = 1; int ll = l;if (arr[i][sj] == arr[i][ej]){while (1){if (arr[i][sj + zz] != arr[i][ej - zz]) break; if (ll < 4){result = max(result,l); break;}ll -= 2; zz++;}}int z..

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV14QpAaAAwCFAYi #include #include #include using namespace std; int result, N;char arr[8][8]; int main(){int T; int t=1;T = 10;while (T--){cin >> N; result = 0;for (int i = 0; i > arr[i][j];}} for (int i = 0; i < 8; i++){for (int j = 0; j < 8; j++){if (i == 1 && j == ..

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV14P0c6AAUCFAYi #include #include #include #include using namespace std; int result;string a, b; int main(){int T; int t;T = 10;while (T--){cin >> t; result = 0;cin >> b >> a;for (int i = 0; i < a.length()-(b.length()-1); i++){if (a.at(i) == b.at(0)){int nexta = i + 1; int nextb = 1;for (int k = 1; k < b.lengt..

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV14BgD6AEECFAYh #include #include #include using namespace std; int result,r;int arr[100][102], a, b;bool visited[100][102]; void cal(int ii, int jj,int cnt){if (ii == 0){if (result >= cnt) { result = cnt; r = jj - 1; }return;}visited[ii][jj] = true; cnt++;if (arr[ii][jj + 1] && !visited[ii][jj+1]) cal(ii, jj ..

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV14ABYKADACFAYh #include #include #include using namespace std; int result;int arr[100][102], a, b;bool visited[100][102]; void cal(int ii, int jj){if (ii == 0){result = jj - 1;return;}visited[ii][jj] = true;if (arr[ii][jj + 1] && !visited[ii][jj+1]) cal(ii, jj + 1);else if (arr[ii][jj - 1] && !visited[ii][jj ..

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV13_BWKACUCFAYh #include #include #include using namespace std; int result;int arr[101][101], a, b; int main(){int T; int t;T = 10;while (T--){cin >> t; result = 0; memset(arr, 0, sizeof(arr)); a = 0; b = 0;for (int i = 0; i > arr[i][j];if (i == j) a += arr[i][j];..

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV13zo1KAAACFAYh #include #include #include using namespace std; int result, a, z;int arr[101]; int main(){int T; int t;cin >> T;while (T--){cin >> t; result = 0; memset(arr, 0, sizeof(arr)); int n = 1000; z = -1;while (n--){cin >> a;arr[a]++;if (result

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV139KOaABgCFAYh #include #include #include #include using namespace std; int result, D;vector v1; void cal(){result = (v1[0] - v1[99]);while (D--){if ((v1[0] - v1[99]) > 1){v1[0]--; v1[99]++;for (int i = 1; i= v1[i])) break; if ((v1[99] >= v1[i]) && (v1[i - 1] >= v1[99])){int tmp2 = v1[99];v1.pop_back();v1.ins..