11561번

· 백준
코드 test_case = int(input()) def binary_search(a, start, end): result = 0 while start a: end = mid - 1 else: result = mid start = mid + 1 return result for _ in range(test_case): stone = int(input()) print(binary_search(stone, 0, stone))