목록SW Expert Academy/Programming - Intermediate (31)
Hikenny25
array_size = 100 ans = list() for _ in range(10): _ = int(input()) data = [list(map(int, input().split())) for _ in range(array_size)] record_list = list() vsum_cross1 = 0 vsum_cross2 = 0 for i in range(array_size): vsum_row = 0 vsum_col = 0 vsum_cross1 += data[i][i] vsum_cross2 += data[i][array_size - 1 - i] for j in range(array_size): vsum_row += data[i][j] vsum_col += data[j][i] record_list.a..
def max_valueandindex(): vmax, vidx = 0, 0 for i in range(100): if height[i] > vmax: vmax = height[i] vidx = i return vmax, vidx def min_valueandindex(): vmin, vidx = 101, 0 for i in range(100): if height[i] < vmin: vmin = height[i] vidx = i return vmin, vidx def is_flatten(): subtract = max(height) - min(height) if subtract
def how_many_light(idx): height_max = max(height[idx-2], height[idx-1], height[idx+1], height[idx+2]) if height[idx] - height_max
t = int(input()) ans = list() for _ in range(t): _ = int(input()) score = list(map(int, input().split())) max_emergence = [0 for i in range(0, 101)] for i in score: max_emergence[i] += 1 vmax = -1 temp_ans = 0 for i in range(101): if max_emergence[i] >= vmax: vmax = max_emergence[i] temp_ans = i ans.append(temp_ans) for i in range(t): print(f"#{i+1} {ans[i]}") 코스 보니까 파이썬 버전이 있고 일반 버전이 있던데 거기서 주는..
def DFS(start): matrix[start[0]][start[1]] = 9 dx = [0, 0, 1, -1] dy = [1, -1, 0, 0] for i in range(4): x = start[0] + dx[i] y = start[1] + dy[i] if 0
def is_operator(x): if x == '+' or x == '-' or x == '*' or x == '/': return True else: return False def calculation(v1, v2, opt): if opt == '+': return v1 + v2 elif opt == '-': return v2 - v1 elif opt == '*': return v1 * v2 else: return v2 / v1 t = int(input()) ans = list() for _ in range(t): data = list(input().split()) data.pop() # . 삭제 stack = list() for i in data: if not is_operator(i): stac..
t = int(input()) ans = list() for _ in range(t): s = list(input()) i = 0 while i < len(s)-1 : if s[i] == s[i+1]: s.pop(i) s.pop(i) i = 0 else: i += 1 ans.append(len(s)) for i in range(t): print(f"#{i+1} {ans[i]}") 간단한 문자열 문제 연속이면 두 요소를 삭제하고 다시 처음부터 탐색하도록 했다~
class Graph: def __init__(self, size): self.size = size self.matrix = [[0] * size for _ in range(size)] self.visited = [0] * size def addEdge(self, v1, v2): self.matrix[v1][v2] = 1 def dfs(self, start): self.visited[start] = 1 for i in range(self.size): if self.matrix[start][i] == 1 and self.visited[i] == 0: self.dfs(i) def dfs2(self, start): stack = [start] while stack: var = stack.pop() if sel..
t = int(input()) ans = list() for _ in range(t): data = list(input()) s = list() flag = 1 for i in data: if i == '(' or i == '{': s.append(i) elif i == ')': if len(s) == 0: flag = 0 break if s[-1] != '(': flag = 0 break else: s.pop() elif i == '}': if len(s) == 0: flag = 0 break if s[-1] != '{': flag = 0 break else: s.pop() else: continue if len(s) != 0: flag = 0 ans.append(flag) for i in range(..
dp = [0, 1, 3] for i in range(28): dp.append(dp[i+2] + 2 * dp[i+1]) t = int(input()) data = [int(input())//10 for _ in range(t)] for i in range(t): print(f"#{i+1} {dp[data[i]]}") 드디어 점화식 세우는 DP 문제가 나왔다... 오랜만이라 점화식 구하는 법도 까먹어서 ㅎ; 조금 헤맸다..