OSNIM

문제 : https://www.acmicpc.net/problem/2531 첫번째 풀이 (pypy3 2772ms, python3 시간초과) import sys def solve(): left = 0 right = k answer = 1 while left < N: eat = set() # 초밥을 k개 만큼 먹기 for i in range(left, right): eat.add(arr[i%N]) # c가 없으면 1개 추가하기 eat.add(c) answer = max(answer, len(eat)) # 1칸씩 밀기 left += 1 right += 1 print(answer) return if __name__=="__main__": input = sys.stdin.readline # N: 접시의 수 # d..

문제 : https://www.acmicpc.net/problem/1484 정답 코드 import sys def solve(): curWeight = 1 memoWeight = 1 answer = [] if G G: if diff == 1: break memoWeight += 1 elif powDiff == G: answer.append(curWeight) memoWeight += 1 elif powDiff < G: curWeight += 1 ..

문제 : https://www.acmicpc.net/problem/2230 정답 코드 import sys def solve(): start = 0 end = 0 answer = 2000000000 while end = M: if answer >= subtraction: answer = subtraction start += 1 if start > end: start -= 1 end += 1 elif subtraction < M: end += 1 print(answer) return if __name__=="__main__": input = sys.stdin.readline N, M = map(in..

문제 : https://www.acmicpc.net/problem/1806 첫번째 제출 코드 (시간초과) import sys def solve(): start = 0 end = 0 answer = N+1 while end = S: if answer > (end+1 - start): answer = (end+1 - start) start += 1 if start > end: end += 1 start -= 1 else: end += 1 if answer == N+1: print(0) else: print(answer) return if __name__ == "__main__": input = sys.stdin.readline N, S = map..

문제 : https://www.acmicpc.net/problem/1644 제출 코드 import sys def makeSieve(n): sqrt = int(n**(0.5)) temp = [1] * (n + 1) for i in range(2, sqrt+1): if temp[i] == 1: for j in range(i*2, n+1, i): temp[j] = 0 return [i for i in range(2, n+1) if temp[i] == 1] def solve(): answer = 0 input = sys.stdin.readline N = int(input()) primes = makeSieve(N) start = 0 end = 0 while end < len(primes): if sum(prim..