반응형 Python9 #10988_팰린드롬(거꾸로 읽을 때 같은 것) arr = list(input()) if arr[:]==arr[::-1]: print(1) else: print(0) 2021. 10. 4. #11005_10진법수 B진법 변환 table = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ" N, B = map(int, input().split()) answer = "" while N !=0 : answer += table[N%B] N//=B print(answer[::-1]) 2021. 10. 4. #11286_절댓값 힙, #11279_최대 힙 #best import sys import heapq input=sys.stdin.readline heap = [] for _ in range(int(input())): x = int(input()) if x != 0: heapq.heappush(heap, [abs(x),x]) else: print(heapq.heappop(heap)[1] if heap else 0) - 힙에 배열 넣기 #try import sys,heapq heap = [] minus = [] for i in range(int(sys.stdin.readline())): x = int(sys.stdin.readline()) if x == 0: if len(heap) == 0 : print(0) elif len(minus) != 0: H .. 2021. 10. 4. #11650_좌표정렬 arr = [] for _ in range(int(input())): arr.append(list(map(int, input().split()))) arr.sort(key=lambda x:(x[0], x[1])) # x좌표 오름차순 후 y좌표 오름차순 for e in arr : print(str(e[0]) + " " + str(e[1])) 2021. 10. 4. 이전 1 2 3 다음 반응형