takeU

from math import factorial as fac n, k = map(int, input().split()) dp = [n] + [0] * k for i in range(1, k + 1): cur = (n + 1) ** (i + 1) - 1 for j in range(i + 1, 1, -1): cur -= dp[i + 1 - j] * fac(i + 1) // fac(i + 1 - j) // fac(j) dp[i] = cur // (i + 1) print(dp[-1] % 1000000007) dp 자연수의 거듭제곱합 일반항 계산

k = int(input()) n = int(input()) dp = [set() for _ in range(9)] for i in range(1, 9): dp[i].add(k * int('1' * i)) for j in range(1, i): for x in dp[j]: for y in dp[i - j]: dp[i].add(x * y) dp[i].add(x + y) dp[i].add(abs(x - y)) if y != 0: dp[i].add(x // y) for _ in range(n): num = int(input()) for i in range(1, 9): if num in dp[i]: print(i) break if i == 8: print("NO") dp

from itertools import combinations, chain word = input() arr = [] res = set() for i, w in enumerate(word): if w == '(': arr.append([i, 0]) elif w == ')': j = -1 while arr[j][1] != 0: j -= 1 arr[j][1] = i for i in range(1, len(arr) + 1): com = list(combinations(arr, i)) for c in com: c = list(chain(*c)) temp = '' for j, w in enumerate(word): if j not in c: temp += w res.add(temp) res = list(res) ..

n = int(input()) li = list(input().split()) res = [list(range(9, 8 - n, -1)), list(range(n + 1))] check = ['>', '

s, n = input().split() s = int(s) res = [[] for _ in range(2 * s + 3)] for i, num in enumerate(n): if num in ['1', '4']: res[0] += [' ' * (s + 2)] else: res[0] += [' ', '-' * s, ' '] for i in range(1, s + 1): if num in ['1', '2', '3', '7']: res[i] += [' ' * (s + 1), '|'] elif num in ['5', '6']: res[i] += ['|', ' ' * (s + 1)] else: res[i] += ['|', ' ' * s, '|'] if num in ['1', '7', '0']: res[s + ..

a, b = map(int, input().split()) print(a + b)