[백준/파이썬] 33663번 루미의 진정한™ 보라색 찾기
-Codeh_s, h_e = map(int, input().split())s_s, s_e = map(int, input().split())v_s, v_e = map(int, input().split())r, g, b = map(int, input().split())M = max(r, g, b)m = min(r, g, b)V = MS = 255 * ((V - m) / V)if V == r: val1 = 0 val2 = g - belif V == g: val1 = 120 val2 = b - relse: val1 = 240 val2 = r - gH = val1 + (60 * val2) / (V - m)if H
2025. 3. 29.