/images/jg_02.jpg

SW Expert Academy_D4 6959, 4613, 6109, 1211

​ D4_6959_이상한 나라의 덧셈게임 1 2 3 4 5 6 7 8 9 10 for T in range(int(input())): N = input() result = ["A", "B"] turn = 1 while len(N) > 1: N = str(int(N[0]) + int(N[1])) + N[2:] turn += 1 print(f'#{T+1}{result[turn%2]}') # 단순 산수 ​ D4_4613_러시아 국기 같은 깃발 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 for T in range(int(input())): N, M = map(int, input().

BEAKJOON 2156, 2565, 10844, 9251

​ 2156_포도주 시식 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 N = int(input()) wine = [0 for _ in range(N)] total = [0 for _ in range(N)] for i in range(N): wine[i] = int(input()) if N == 1: total[0] = wine[0] else: total[0] = wine[0] total[1] = wine[0] + wine[1] for i in range(2, N): total[i] = max(total[i-1], total[i-2] + wine[i], total[i-3] + wine[i] + wine[i-1]) print(total[N-1]) # N == 1인 경우를 생각하지 않았을 땐 런타임 오류에 걸렸었다.

BEAKJOON 1912, 9184, 11053, 11054

​ 1912_연속합 1 2 3 4 5 6 7 8 9 10 11 12 import sys N = int(sys.stdin.readline().rstrip()) arr = list(map(int, sys.stdin.readline().split())) result = [arr[0]] for i in range(N-1): result.append(max(result[i]+arr[i+1], arr[i+1])) print(max(result)) # dp 연습하기 좋은 문제 ​ 9184_신나는 함수 실행 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 32 33 34 def w(a,b,c): if a <= 0 or b <= 0 or c <= 0: return 1 if a > 20 or b > 20 or c > 20: return w(20, 20, 20) if dp[a][b][c]: return dp[a][b][c] if a < b and b < c: dp[a][b][c] = w(a, b, c-1) + w(a, b-1, c-1) - w(a, b-1, c) return dp[a][b][c] dp[a][b][c] = w(a-1, b, c) + w(a-1, b-1, c) + w(a-1, b, c-1) - w(a-1, b-1, c-1) return dp[a][b][c] dp = [[[0]*21 for _ in range(21)] for _ in range(21)] while True: a, b, c = map(int, input().

SW Expert Academy_D3 5678, 5672, 7465, 7701

​ D4_5678_[Professional] 팰린드롬 1 2 3 4 5 6 7 8 9 10 11 12 for T in range(int(input())): S = " " + input() L = len(S) result = 1 for i in range(2, L): for j in range(L-i): if S[j+1:j+i+1] == S[j+i:j:-1]: result = i print(f'#{T+1}{result}') # 슬라이싱을 잘 고민 하면 쉽게 해결 ​ D4_5672_[Professional] 올해의 조련사 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 32 33 34 35 36 37 38 39 40 41 42 43 for T in range(int(input())): q = [] n = "" for N in range(int(input())): q.