🐍 Python/백준

[2231] 분해합

import sys N = sys.stdin.readline().strip() def solve(N): arr = [] for i in range(int(N)+1): temp = i for j in list(str(temp)): temp += int(j) if temp == int(N): arr.append(i) else: pass if len(arr) == 0: return 0 else: return min(arr) print(solve(N)) 2231 분해합

[2798] 블랙잭

import sys N, M = map(int, sys.stdin.readline().rstrip().split()) arr = list(map(int, sys.stdin.readline().rstrip().split())) result = 0 for i in range(N-2): for j in range(i+1, N-1): for k in range(j+1, N): if arr[i] + arr[j] + arr[k] > M: continue else: result = max(result, arr[i] + arr[j] + arr[k]) print(result) 2798 블랙잭

[1929] 소수 구하기

import sys M, N = map(int, sys.stdin.readline().rstrip().split()) def sol(M, N): arr = [True] * (N+1) for i in range(M, N+1): for j in range(2, int(i**0.5) +1): if i % j == 0: arr[i] = False break if i > 1 and arr[i]: print(i) sol(M, N) 1929 소수 구하기

[11653] 소인수분해

import sys N = int(sys.stdin.readline()) for i in range(2, N+1): while N % i == 0: N = N // i print(i) 11653 소인수분해

[2581] 소수

import sys M = int(sys.stdin.readline()) N = int(sys.stdin.readline()) arr = [] for i in range(M, N+1): temp = [] for j in range(1, i+1): if i % j == 0: temp.append(j) if len(temp) == 2: arr.append(i) if len(arr) == 0: print(-1) else: print(sum(arr)) print(arr[0]) 2581 소수 M = int(input()) N = int(input()) prime = [] for i in range(M, N+1): if i != 1: check = True for j in range(2, i): if i % j =..