나만의 깍두기판

1. 문제https://www.acmicpc.net/problem/4134  2. 풀이count = int(input())def is_prime(n): if n

1. 문제https://www.acmicpc.net/problem/1620  2. 풀이import sysn, m = map(int, sys.stdin.readline().split())pokemon = {}for i in range(1, n+1): value = sys.stdin.readline().strip() pokemon[i] = value pokemon[value] = ifor _ in range(m): target = sys.stdin.readline().strip() print(pokemon[int(target)] if target.isdigit() else pokemon[target]) - 파이썬은 입력에 시간 복잡도가 굉장히 크게 들어가기 때문에, sys를 imp..

1. 문제https://www.acmicpc.net/problem/1269   2. 풀이n, m = map(int, input().split())a = set(input().split())b = set(input().split())c = (a - b) | (b - a)print(len(c))

1. 문제https://www.acmicpc.net/problem/2480  2. 풀이a, b, c = map(int, input().split())isAEqualB = a == bisBEqualC = b == cisCEqualA = c == aif(isAEqualB and isBEqualC and isCEqualA ): reward = 10000 + a * 1000 print(reward)elif isAEqualB: reward = 1000 + a * 100 print(reward)elif isBEqualC: reward = 1000 + b * 100 print(reward)elif isCEqualA: reward = 1000 + c * 100 print(re..