목록전체 글 (601)
sm 기술 블로그
from collections import deque import sys input = sys.stdin.readline T = int(input()) for _ in range(T): N, M = map(int, input().split()) importance = deque(list(map(int, input().split()))) index = list(range(len(importance))) index[M] = 'T' cnt = 0 while True: if importance[0] == max(importance): cnt += 1 if index[0] == 'T': print(cnt) break else: index.pop(0) importance.popleft() else: index.ap..
import java.util.*; import java.io.*; class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); StringBuilder sb = new StringBuilder(); int N = sc.nextInt(); int K = sc.nextInt(); Deque queue = new ArrayDeque(); for (int i = 1; i
from collections import deque import sys input = sys.stdin.readline N, K = map(int, input().split()) queue = deque(list(i for i in range(1, N+1))) answer = [] while queue: for i in range(K-1): queue.append(queue.popleft()) answer.append(queue.popleft()) print("") 문제요약 요세푸스 순열을 완성하시오. https://m.blog.naver.com/PostView.naver?isHttpsRedirect=true&blogId=attractorlim&logNo=221030930874 요세푸스문제 Joseph..