[swea] 1989. 초심자의 회문검사 : python

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=2&contestProbId=AV5PyTLqAf4DFAUq&categoryId=AV5PyTLqAf4DFAUq&categoryType=CODE&problemTitle=&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=2&pageSize=10&pageIndex=1 

SW Expert Academy

---

def palindrome(word):
    if word == word[::-1]:
        return 1

    else:
        return 0
        
test_case = int(input())

for i in range(test_case):
    word = input()
    
    print(f'#{i+1}', end = ' ')
    
    print(palindrome(word))

슬라이싱을 이용해 문자를 뒤집고 뒤집어진 문자와 원래 문자가 같으면 1을 출력하도록 구현했다