반응형 [Softeer] Lv1: 위험한 효도(7368) 문제- 문제 링크: https://softeer.ai/practice/7368 풀이더보기import sysa, b, d = map(int, input().split())time = 0move = 0while (d > move): time += a move += a if (move >= d): time -= (move - d) move = d break time += b; while (2*d > move) and (move >= d): time += b move += b if (move >= 2*d): time -= (move - 2*d) move = 2*d break .. 2025. 2. 9. [Softeer] Lv1: 나무 심기(7353) 문제- 문제 링크: https://softeer.ai/practice/7353 풀이더보기import sysn = int(input())arr = list(map(int, input().split()))arr.sort()a = arr[0] * arr[1]b= arr[len(arr) - 2] * arr[len(arr) - 1]max_val = a if a > b else bprint(max_val) 2025. 2. 9. [Softeer] Lv1: A+B(6295) 문제- 문제 링크: https://softeer.ai/practice/6295 풀이더보기import sysn = int(input())for i in range(n): a, b = input().split() a, b = int(a), int(b) print(f"Case #{i + 1}: {a + b}") 2025. 2. 9. [Softeer] Lv1: 근무 시간(6254) 문제- 문제 링크: https://softeer.ai/practice/6254 풀이더보기import systotal = 0for i in range(5): start, end = input().split() total += (int(end[0:2]) - int(start[0:2])) * 60 total += int(end[3:5]) - int(start[3:5])print(total) 2025. 2. 9. [Softeer] Lv1: 주행거리 비교하기(6253) 문제- 링크: https://softeer.ai/practice/6253 풀이더보기더보기import sysa, b = input().split()a, b = int(a), int(b)if a > b: print("A")elif a 2025. 2. 8. 이전 1 다음 반응형
