https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AY6ci8cKecUDFAXt&categoryId=AY6ci8cKecUDFAXt&categoryType=CODE&problemTitle=&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=&pageSize=10&pageIndex=1 코드def gcd(a, b): # a와 b의 최소공배수 구하기 if b == 0: return a return gcd(b, a % b)for tc in range(1, int(input())+1): n = int(input()) board = [input()..
문제풀이
https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AY9QTGqqcckDFAVF&categoryId=AY9QTGqqcckDFAVF&categoryType=CODE&problemTitle=&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=&pageSize=10&pageIndex=1 코드for tc in range(1, int(input())+1): possible = [0, 0, 0] s, k = input().split() ball = s.index('o') k = int(k) if k == 0: ans = ball elif..
https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=4&contestProbId=AY9QUhl6cfQDFAVF&categoryId=AY9QUhl6cfQDFAVF&categoryType=CODE&problemTitle=&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=&pageSize=10&pageIndex=1 코드for tc in range(1, int(input())+1): n = int(input()) arr = [-1]+list(map(int, input().split()))+[-1] empty = n+1 # 현재 비어있는 자리 # 처음에 자..
https://www.acmicpc.net/problem/1455 코드import sysinput = sys.stdin.readlinen, m = map(int, input().split())board = [list(input()) for _ in range(n)]ans = 0for i in range(n-1, -1, -1): for j in range(m-1, -1, -1): if board[i][j] == '1': # 뒷면 # 뒤집기 for r in range(i+1): for c in range(j+1): board[r][c] = ('0' if board[r][c] == '1'..
https://www.acmicpc.net/problem/5549 코드import sysinput = sys.stdin.readlinem, n = map(int, input().split())k = int(input())map_data = [input() for _ in range(m)]# 누적합accum = [[[0]*3 for _ in range(n+1)] for _ in range(m+1)]for i in range(1, m+1): for j in range(1, n+1): accum[i][j][0] = accum[i-1][j][0]+accum[i][j-1][0]-accum[i-1][j-1][0] accum[i][j][1] = accum[i-1][j][1]+accum[..
