[백준] 재귀의 귀재

문제

def recursion(s, l, r, c):
    c += 1
    if l >= r: return 1, c
    elif s[l] != s[r]: return 0, c 
    else: return recursion(s, l+1, r-1, c)

def isPalindrome(s):
    return recursion(s, 0, len(s)-1, 0)

cnt = int(input())

for i in range(cnt):
    txt = input()
    print(isPalindrome(txt)[0], isPalindrome(txt)[1])

PREVIOUS[백준] 색종이 만들기