@kimjuha19

for i in range(2,9): for j in range(1,9): if j % 3 == 0: continue else: print(f"{i} X {j} = {i*j}")

stock = [100, 110, 120, 115, 130, 140, 150, 120] answer = 1 max = 0 for i in range(len(stock)-1): if stock[i] < stock[i+1]: answer += 1 if answer > max: max = answer else:

montain = [1, 3, 2, 5, 8, 4, 3] answer = 0 for i in range(1,len(montain)-1): if montain[i] > montain[i - 1] and montain[i] > montain[i + 1]: answer += 1 print(answer)

H = 10 A = 3 B = 1 total = 0 day = 0 while total < H: day += 1 total += A if total >= H:

students = [("태민", 95), ("민수", 88), ("지우", 98)] ranking = sorted(students, key=lambda x: x[1], reverse=True) print(ranking)

n = 6 answer = 0 for i in range(1,n): if n % i == 0: answer += i if n == answer: print("완전수입니다") else: print("일반수입니다")

numbers = [5, 2, 8, 5, 1, 2, 10] result = sorted(set(numbers)) for i in result: print(i, end=" ")

L = 1 E = 50 get = [200,150] for i in range(len(get)): E += get[i] while E >= L * 100: E -= L * 100 L += 1

atm = 150000 H = 22 charge = 500 answer = 0 if H <= 9 or H >= 18: charge = charge * 2 if atm >= 100000: charge = 0

batting_average = [1, 0, 0, 1, 0, 0, 0, 1, 0, 1] count = 0 answer = 0 for i in range(len(batting_average)): if batting_average[i] == 1: count += 1 answer = count / 10

finedust = [110, 70, 120, 80, 110] for i in range(len(finedust)-1): if finedust[i] > 100 and finedust[i+1] > 100: print("비상 발령 조치") break else: print("정상(연속되지 않음)")

count = 0 password = "7777" while count < 3: user = input() if user == password: print("환영합니다") break else:

W = 11 F = 5 T = 3 bag = 0 while W > 0: if W % F == 0: bag += W // F break

kwh = 500 moeny = 0 if kwh <= 200: moeny = kwh * 100 elif kwh <= 400: moeny = 200 * 100 + (kwh - 200) * 200 else: moeny = 200 * 100 + 200 * 200 + (kwh - 400) * 300

N = 3 M = 3 attempts = [(1,1), (2,2), (1,1)] seats = [[0]*M for _ in range(N)] for r, c in attempts: r_idx = r - 1 c_idx = c - 1

def find_depth(tree, target, depth=0): for key, subtree in tree.items(): if key == target: return depth d = find_depth(subtree, target, depth + 1) if d is not None: return d return None mall =

H = 3 count = 0 def dfs(current_height): global count if current_height == H: count += 1 return

A_friends = {"IU", "V", "JK"} B_friends = {"V", "JK", "Jimin"} common = A_friends & B_friends recommend = A_friends - B_friends print("공통 친구:", common) print("추천 후보:", recommend)

orders = [("A", 3, 10), ("B", 1, 20)] orders.sort(key=lambda x: x[2], reverse=True) for o in orders: print(o[0], end=" -> ")

content = [3, 5, 2, 8, 1] day = 3 max_sum = 0 for i in range(len(content) - day + 1): current_sum = 0 for j in range(day): current_sum += content[i + j] if current_sum > max_sum: