혜랑's STORY

code #include using namespace std; int dx[4] ={-1, 1, 0, 0}; int dy[4] = {0, 0, 1, -1}; int board[500][500]; bool visited[500][500]; int MAX, n, m; void ufind(int y, int x){ // ㅜ, ㅗ, ㅏ, ㅓ 순서 if(y + 1 = 0 && x + 2 < m) MAX = max(MAX, board[y][x] + board[y][x + 1] + board[y][x + 2] +..

code #define _CRT_SECURE_NO_WARNINGS #include using namespace std; int moveN[101]; int check[101]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); memset(check, 0, sizeof(check)); for (int i = 1; i > n >> m; int temp1, temp2; for (int i = 0; i > temp1 >> temp2; moveN[temp1] = temp2; } check[1] = 0; qu..

code #define _CRT_SECURE_NO_WARNINGS #include using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, pos; cin >> n; pos = 1; for (int sum = 1; sum < n; pos++) { sum += 6 * pos; } printf("%d", pos); return 0; } 1 : 1번 2 ~ 7 : 2번 (+) 6 8 ~ 19 : 3번 (+) 12 20 ~ 37 : 4번 (+) 18 38 ~ 61 : 5번 (+) 24 벌집에서 방을 지나가는 수를 보면 6, 12, 18, 24 순으로 증가하면서 지나가는 방의 수가 ..

code #define _CRT_SECURE_NO_WARNINGS #include using namespace std; int cnt[3]; int arr[2187][2187]; void paper(int size, int x, int y) { bool check = true; for (int i = x; i < x + size; i++) { for (int j = y; j < y + size; j++) { if (arr[i][j] != arr[x][y]) { check = false; break; } } } if (check) { cnt[arr[x][y] + 1]++; return; } for (int i = x; i < x + size; i += size / 3) { for (int j = y; j ..

code #define _CRT_SECURE_NO_WARNINGS #include using namespace std; int maxdp[3][2]; int mindp[3][2]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, temp1, temp2, temp3; cin >> n; maxdp[0][0] = maxdp[1][0] = maxdp[2][0] = 0; mindp[0][0] = mindp[1][0] = mindp[2][0] = 0; for (int i = 1; i > temp1 >> temp2 >> temp3; maxdp[0][1] = max(maxdp[0][0], maxdp[1][0]) + ..

code #define _CRT_SECURE_NO_WARNINGS #include #include #include using namespace std; int n, cnt = 0; int list[15]; void N_Queen(int x) { bool flag; if (x == n) cnt++; else { for (int i = 0; i < n; i++) { list[x] = i; flag = true; for (int j = 0; j < x; j++) { if (list[x] == list[j] || abs(list[x] - list[j]) == (x - j)) { flag = false; break; } } if (flag) N_Queen(x + 1); } } } int main() { ios_b..

code #define _CRT_SECURE_NO_WARNINGS #include #include #include using namespace std; int dp[1000001]; int visited[1000001]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); memset(dp, 0, sizeof(dp)); memset(visited, 0, sizeof(visited)); int n; cin >> n; dp[1] = 0; for (int i = 2; i dp[i / 2] + 1) { dp[i] = dp[i / 2] + 1; visited[i] = i / 2; } if (i % 3 == 0 && dp[i] ..

code #define _CRT_SECURE_NO_WARNINGS #include #include #include using namespace std; bool visited[1001]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, num, strike, ball, cnt = 0, s_cnt, b_cnt; string temp, num_str; memset(visited, true, sizeof(visited)); for (int i = 123; i < 1000; i++) { temp = to_string(i); if (temp[0] == temp[1] || temp[1] == temp[2] || ..