백준원판돌리기 썸네일형 리스트형 [Python][백준 9095번] 123 더하기 n = int(input()) m = 3 nums = [1, 2, 3] dp = [0]*11 dp[0] = 1 for i in range(len(dp)): for j in range(m): if i - nums[j] >= 0: dp[i] += dp[i-nums[j]] print("dp", dp) 더보기 [Python][백준 17822번] 원판돌리기 # https://www.acmicpc.net/problem/17822 # 첫번째 시도 import copy import heapq as hq import sys from functools import reduce from collections import deque, defaultdict sys.stdin = open("input.txt", "rt") sys.setrecursionlimit(1501*1501) N, M, T = map(int, input().split()) board = [[0]*M for _ in range(N+1)] for i in range(N): board[i+1] = deque(list(map(int, input().split()))) for _ in range(T): x, d.. 더보기 이전 1 다음