import sys from collections import deque n = int(sys.stdin.readline()) for _ in range(n): m, t = map(int, sys.stdin.readline().split()) q = deque(map(int, sys.stdin.readline().split())) q.reverse() cur_idx = len(q) - t - 1 res = 1 h_flag = True while True: frontQ = q[-1] for i in q: if i > frontQ: q.rotate() h_flag = False break if h_flag: if cur_idx == len(q)-1: print(res) break q.pop() res += ..
import sys k, n = map(int, sys.stdin.readline().split()) arr = [int(sys.stdin.readline()) for _ in range(k)] e = max(arr) s = 1 while s = n: s = mid+1 else: e = mid-1 print(e)
import sys import math n, m = map(int, sys.stdin.readline().split()) arr = [sys.stdin.readline().strip() for _ in range(n)] minV = math.inf for i in range(n-7): for j in range(m-7): w, b = 0, 0 for y in range(i, i+8): for x in range(j, j+8): if (x+y)%2 == 0: if arr[y][x] != 'W': w += 1 else: b += 1 else: if arr[y][x] != 'B': w += 1 else: b += 1 if w < b: if w < minV: minV = w else: if b < minV: ..
import collections n = int(input()) q = collections.deque(reversed(range(1, n+1))) while len(q) > 1: q.pop() q.rotate() print(q[0])
import sys from collections import Counter n = sys.stdin.readline() c = Counter(sys.stdin.readline().split()) m = sys.stdin.readline() arr = sys.stdin.readline().split() for i in arr: print(c[i], end=' ')
import collections n, k = map(int, input().split()) q = collections.deque() for i in range(1,n+1): q.appendleft(i) print(' 1: q.rotate(k) a = q.popleft() print(a, end=", ") print(q.pop(), end='') print('>') list 대신 queue 이용 queue의 rotate 메소드를 사용하여 삭제하려는 값을 가장 왼 쪽에 위치시킴
t = int(input()) arr = [] first = [] for i in range(1, 15): first.append(i*(i+1)//2) arr.append(first) for _ in range(t): k = int(input()) n = int(input()) if len(arr) < k: for _ in range(2, k+1): temp = [] sum = 0 for i in range(1, 15): sum += arr[-1][i - 1] temp.append(sum) arr.append(temp) print(arr[k-1][n-1])
