Algorithm
-
백준(BaekJoon)_15651_N과M(3)Algorithm/Problems_Solving 2022. 8. 21. 12:48
# 15651 N과 M(1)은 중복이 허용되지 않는데, 여기서는 중복을 허용 (즉 자연수 n과 같은 수도 출력하는것) result = [] def func(n,m): if len(result) == m: print(" ".join(map(str, result))) else: for i in range(1,n+1): result.append(i) func(n,m) result.pop() n, m = map(int, input().split()) func(n,m)
-
백준(BaekJoon)_15650_N과 M(2)Algorithm/Problems_Solving 2022. 8. 21. 11:36
res = [] def func(n,m): if len(res) == m: test = res[:] test.sort() if (test == res): for ele in res: print(ele, end= " ") print() return else: for i in range(1,n+1): if i not in res: res.append(i) func(n,m) res.pop() n, m = map(int, input().split()) func(n,m) ========================================================== # 다른풀이 n,m = list(map(int,input().split())) result = [] def func(start): if m ..
-
백준(BaekJoon)_15649_N과M(1)Algorithm/Problems_Solving 2022. 8. 21. 11:33
result = [] def func(n,m): if len(result) == m: for i in result: print(i, end=" ") print() return else: for i in range(1,n+1): if i not in result: result.append(i) func(n,m) result.pop() n, m = map(int, input().split()) func(n,m) ================================================ cf. 같은 결과를 낸다 if len(result) == m: for i in result: print(i, end=" ") print() if len(result)==m: print(' '.join(map(str..
-
백준(BaekJoon)_9506_약수들의합Algorithm/Problems_Solving 2022. 8. 20. 21:19
def func(num): answer = f"{num} = " factors = [i for i in range(1,num//2+1) if num % i == 0] if num == sum(factors): exp = " + ".join(map(str,factors)) answer += exp return answer else: return f"{num} is NOT perfect." if __name__ == "__main__": while True: num = int(input()) if num == -1: break print(func(num))