takeU

import sys input = sys.stdin.readline def interval_sum(start, end, index, left, right): if left > end or right end: return tree[index] += ..

https://www.youtube.com/watch?v=Y7C8qIpo7Dg https://www.youtube.com/watch?v=Sc7cbShMS3U https://www.youtube.com/watch?v=zZdT7bpzlig https://www.youtube.com/watch?v=H-9co9kMS2o https://www.youtube.com/watch?v=9voN0gkdlS4 https://www.youtube.com/watch?v=vd3IlOjSUGQ https://www.youtube.com/watch?v=7HgJIAUtICU https://www.youtube.com/watch?v=F1QF4wOQhjE 댓노추 (댓글에 노래 추천좀이라는뜻)

n, m = map(int, input().split()) board = [list(map(int, input().split())) for _ in range(n)] prefix_sum = [[0] * (m + 1) for _ in range(n + 1)] for i in range(1, n + 1): for j in range(1, m + 1): prefix_sum[i][j] = prefix_sum[i - 1][j] + prefix_sum[i][j - 1] + \ board[i - 1][j - 1] - prefix_sum[i - 1][j - 1] def acc(mat, x1, y1, x2, y2): return mat[x2][y2] - mat[x1 - 1][y2] - mat[x2][y1 - 1] + m..

from heapq import heappop, heappush import sys input = sys.stdin.readline n, m = map(int, input().split()) indegree = [0] * (n + 1) graph = [[] for _ in range(n + 1)] for _ in range(m): a, b = map(int, input().split()) graph[a].append(b) indegree[b] += 1 def topological_sort(): ans = [] h = [] for i in range(1, n + 1): if indegree[i] == 0: heappush(h, i) while h: cur = heappop(h) ans.append(cur)..

n = int(input()) li = list(map(int, input().split())) if len(li) == 1: print('A') elif len(set(li)) == 1: print(li[0]) elif len(li) == 2: print('A') else: a = (li[1] - li[2]) // (li[0] - li[1]) if (li[0] - li[1]) else 0 b = li[1] - li[0] * a for i in range(n - 1): if (li[i + 1] != li[i] * a + b): print('B') exit() print(li[-1] * a + b) 수학

def itots(c): if '0'

https://www.youtube.com/watch?v=k9Hu3Hbm5GM https://www.youtube.com/watch?v=KvT5mGSpvfo https://www.youtube.com/watch?v=SsCABOVsUrc https://www.youtube.com/watch?v=SPXHCxaQjy0 https://www.youtube.com/watch?v=_7-N1gUXb8c https://www.youtube.com/watch?v=Vbylrrw5CeI https://www.youtube.com/watch?v=P-5hvP1tALs

def check(): for i in range(n): if a[i] != b[i]: return False return True n, m = map(int, input().split()) a = [list(map(int, list(input()))) for _ in range(n)] b = [list(map(int, list(input()))) for _ in range(n)] ans = 0 for i in range(n - 2): for j in range(m - 2): if a[i][j] != b[i][j]: for x in range(i, i + 3): for y in range(j, j + 3): a[x][y] ^= 1 ans += 1 print(ans if check() else '-1') 구현

from collections import deque n, m = map(int, input().split()) board = [list(map(int, list(input()))) for _ in range(m)] visited = [[0] * n for _ in range(m)] visited[0][0] = 1 dx, dy = [-1, 1, 0, 0], [0, 0, -1, 1] q = deque([[0, 0, 0]]) while q: x, y, c = q.popleft() if x == m - 1 and y == n - 1: print(c) break for i in range(4): nx, ny = x + dx[i], y + dy[i] if 0