1. 문제 링크https://www.acmicpc.net/problem/142152. 문제 3. 소스코드ls = sorted(list(map(int, input().split())))if ls[0] + ls[1] > ls[2]: print(sum(ls))else: print((ls[0]+ls[1])*2-1)

1. 문제 링크https://www.acmicpc.net/problem/50732. 문제 3. 소스코드while True: a, b, c = map(int, input().split()) if a==b==c==0: break if sum((a, b, c)) - max((a,b,c))

1. 문제 링크https://www.acmicpc.net/problem/101012. 문제  3. 소스코드a = [int(input()) for i in range(3)]if a.count(60) == 3: print("Equilateral")elif sum(a) == 180 and len(set(a)) == 2: print("Isosceles")elif sum(a) == 180 and len(set(a)) == 3: print("Scalene")else: print("Error")

1. 문제 링크https://www.acmicpc.net/problem/90632. 문제 3. 소스코드n=int(input())x_list = []y_list = []for _ in range(n): x, y = map(int, input().split()) x_list.append(x) y_list.append(y)width = max(x_list)-min(x_list)height = max(y_list)-min(y_list)print(width*height)

1. 문제 링크https://www.acmicpc.net/problem/30092. 문제3. 소스코드x_nums = []y_nums = []for _ in range(3): x, y = map(int, input().split()) x_nums.append(x) y_nums.append(y) for i in range(3): if x_nums.count(x_nums[i]) == 1: x4 = x_nums[i] if y_nums.count(y_nums[i]) == 1: y4 = y_nums[i]print(x4, y4)

1. 문제 링크https://www.acmicpc.net/problem/10852. 문제3. 소스코드x,y,w,h=map(int, input().split())print(min(x, y, w-x, h-y))