[ 알고리즘 ]/DP

[프로그래머스] N으로 표현

📌문제 https://programmers.co.kr/learn/courses/30/lessons/42895 🎖️난이도 Level 3 ✔️풀이 # sol def solution(N,number): answer=-1 S=[set() for x in range(8)] for i,x in enumerate(S,start=1): x.add(int(str(N)*i)) for i in range(1,len(S)): for j in range(i): for op1 in S[j]: for op2 in S[i-j-1]: S[i].add(op1+op2) S[i].add(op1-op2) S[i].add(op1*op2) if op2!=0: S[i].add(op1//op2) if number in S[i]: answer=i+1..

[백준] 17979. What's Mine is Mine

📌문제 https://www.acmicpc.net/problem/17979 🎖️난이도 ✔️풀이 # sol1) pypy3으로 제출시 정답 (python3은 시간초과) x = input() m, n = map(int, x.split()) type_price = [0]*m for i in range(m): type_price[i] = int(input()) task_list = [0]*n for i in range(n): x = input() tmp_list = list(map(int, x.split(' '))) # [s, e, t] tmp_list[2] = (tmp_list[1] - tmp_list[0]) * type_price[tmp_list[2]-1] task_list[i] = tmp_list task_..

[백준] 17968. Fire on Field

📌문제 https://www.acmicpc.net/problem/17968 🎖️난이도 ✔️풀이 A = [1, 1] n = int(input()) for i in range(2, n+1): tmp_Ai = 1 k = 1 while i - 2*k >= 0: # 모든 k 확인 용 if tmp_Ai - A[i-k] != A[i-k] - A[i-k*2]: k += 1 continue tmp_Ai += 1 k = 1 continue A.append(tmp_Ai) print(A[n])