2일차 - 이진탐색

def count_binarysearch(page, object):
    left = 1
    right = page

    cnt = 0
    while(left <= right):
        middle = (left + right) // 2
        if middle == object:
            return cnt
        elif middle > object:
            right = middle
        else:
            left = middle
        cnt += 1
    return -1

t = int(input())
answer = list()

for _ in range(t):
    p, pa, pb = map(int, input().split())

    cpa = count_binarysearch(p, pa)
    cpb = count_binarysearch(p, pb)

    if cpa > cpb:
        answer.append('B')
    elif cpa < cpb:
        answer.append('A')
    else:
        answer.append('0')

for i in range(t):
    print(f"#{i+1} {answer[i]}")

 

간단한 이진탐색 구현 문제였다..

오랜만에 구현하는데 감 잡는 좋은 문제인듯!