출처 : 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..
출처 : https://www.acmicpc.net/problem/9466 #include #include #include using namespace std; int N, arr[100001], result;bool check[100001], e[100001]; void dfs(int now){check[now] = true;if (check[arr[now]]){if (!e[arr[now]]){for (int i = arr[now]; i != now; i = arr[i]) result++;result++;}}else dfs(arr[now]);e[now] = true;} int main(){int t = 1; int T;cin >> T;while (T--){result = 0; memset(arr, 0,..
출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV134DPqAA8CFAYh#none #include #include #include using namespace std; int N, arr[1000], result; int main(){int t = 1, T = 10;while (T--){result = 0; memset(arr, 0, sizeof(arr));cin >> N;for (int i = 0; i > arr[i];for (int i = 2; i < N - 2; i++){int tmp = arr[i] - max(max(arr[i - 2], arr[i - 1]), m..
출처 : https://www.acmicpc.net/problem/14890 #include using namespace std; int i, j;int N;int L;int arr[105][105];int arr2[105][105];int arr3[105][105];int result; void get_info(){cin >> N >> L;for (i = 0;i > arr[i][j];arr2[i][j] = 10;arr3[i][j] = 10;}} } void print_info(){cout 1 || arr2[i][j] < -1) // 1초과 -1 미만 경우{result--;} if (arr2[i][j] == 0) // 0인 경우{coun..
출처 : https://www.acmicpc.net/problem/14503 #include #include using namespace std; int N, M, K, result, direction, starti, startj;int map[50][50];bool visited[50][50];int dir[4][2] = { {0,-1},{1,0},{0,1},{-1,0} };bool finished; void cal(int i, int j, int d){if (finished) return; visited[i][j] = true; map[i][j] = 2; int startD; if (d == 0) startD = 0;else if (d == 1) startD = 3;else if (d == 2) st..
- Total
- Today
- Yesterday
- 17837
- 17142
- 2018 KAKAO BLIND RECRUITMENT
- DFS
- 시간 복잡도
- 삼성
- 이차원 배열과 연산
- 역량 테스트
- 2018 카카오 블라인드 채용
- 게리맨더링 2
- hackerrank
- 17144
- 연구소 3
- 알고리즘
- scanf
- boj
- SW Expert Academy
- 미세먼지 안녕!
- 17143
- 17140
- SWEA
- 백준
- string
- 새로운 게임 2
- 트렌드
- 입출력
- DP
- 팁
- 17779
- STL
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | 5 | ||
6 | 7 | 8 | 9 | 10 | 11 | 12 |
13 | 14 | 15 | 16 | 17 | 18 | 19 |
20 | 21 | 22 | 23 | 24 | 25 | 26 |
27 | 28 | 29 | 30 | 31 |