여름의 서재

n = int(input()) result = [] stack = [] count = 0 X = True for _ in range(n): num = int(input()) while count < num: count += 1 stack.append(count) result.append('+') if stack[-1]== num: stack.pop() result.append('-') else: X = False if X : for i in result: print(i) else : print('NO')

K,N = map(int,input().split()) line = [] for _ in range(K): line.append(int(input())) start, end = 1, max(line) while start = N: start = mid + 1 else: end = mid - 1 print(end)

a = input().split('-') count = 0 lst = list(map(int,a[0].split('+'))) count += sum(lst) for i in a[1:]: lst = list(map(int,i.split('+'))) count -= sum(lst) print(count)

N, M = list(map(int, input().split())) pan = [input() for _ in range(N)] answer = [] for i in range(N-7): for j in range(M-7): first_W = 0 first_B = 0 for k in range(i,i+8): for l in range(j,j+8): if (k+l) % 2 == 0: if pan[k][l] == 'W': first_B += 1 else: first_W += 1 else: if pan[k][l] == 'W': first_W += 1 else: first_B += 1 answer.append(min(first_W,first_B)) print(min(answer))

import sys string_list = sys.stdin.readline() temp = False result = &#39;&#39; string = &#39;&#39; for i in string_list: if i == &#39;>&#39;: temp = False if temp: result += i continue if i.isalpha() or i.isdigit(): string += i else: result += string[::-1] result += i string = &#39;&#39; if i == &#39;

from collections import deque T = int(input()) for _ in range(T): N, K = map(int,input().split()) lst = deque(map(int,input().split())) target = deque(0 for _ in range(N)) target[K]=1 temp = 0 while sum(target): if lst[0] == max(lst): lst.popleft() target.popleft() temp+=1 else : lst.append(lst.popleft()) target.append(target.popleft()) print(temp)

import sys A, B = sys.stdin.readline().split() B_list = list(B) min_result = len(A) for i in range(len(B)-len(A)+1): result = 0 for j in range(1, len(A)+1): if A[-j]!=B_list[-j]: result += 1 if min_result > result: min_result = result B_list.pop() print(min_result)

from collections import deque N, K = map(int,input().split()) lst = deque(map(int,input().split())) deq = deque(i+1 for i in range(N)) temp = 0 while lst : if deq[0] == lst[0]: deq.popleft() lst.popleft() else: if deq.index(lst[0])