takeU

n = int(input()) li = list(map(int, input().split())) match = list(map(int, input().split())) for i in range(n - 1, 0, -1): if li == match: break idx = li.index(max(li[:i + 1])) if idx != i: li[idx], li[i] = li[i], li[idx] print(1 if li == match else 0) 선택정렬

n, k = map(int, input().split()) li = list(map(int, input().split())) sorted_li = sorted(li) d = {} for i, l in enumerate(li): d[l] = i i = n - 1 for i in range(n - 1, -1, -1): if sorted_li[i] != li[i]: temp = [li[i], sorted_li[i]] li[i], li[d[sorted_li[i]]] = li[d[sorted_li[i]]], li[i] d[temp[0]], d[temp[1]] = d[temp[1]], d[temp[0]] k -= 1 if k == 0: print(*li) exit() print(-1) 선택정렬, 딕셔너리

n, k = map(int, input().split()) li = list(map(int, input().split())) sorted_li = sorted(li) d = {} for i, l in enumerate(li): d[l] = i i = n - 1 for i in range(n - 1, -1, -1): if sorted_li[i] != li[i]: temp = [li[i], sorted_li[i]] li[i], li[d[sorted_li[i]]] = li[d[sorted_li[i]]], li[i] d[temp[0]], d[temp[1]] = d[temp[1]], d[temp[0]] k -= 1 if k == 0: print(*temp) exit() print(-1) 선택정렬, 딕셔너리

import sys input = sys.stdin.readline n, m = int(input()), int(input()) p = list(range(n + 1)) def find_parent(parent, x): if parent[x] != x: return find_parent(parent, parent[x]) return x def union_parent(parent, a, b): a = find_parent(parent, a) b = find_parent(parent, b) if a < b: parent[b] = a else: parent[a] = b for i in range(n): li = list(map(int, input().split())) for j in range(n): if l..

n, k = map(int, input().split()) li = list(map(int, input().split())) for i in range(n - 1, 0, -1): for j in range(i): if li[j] > li[j + 1]: li[j], li[j + 1] = li[j + 1], li[j] k -= 1 if k == 0: print(*li) exit() print(-1) 정렬

n, k = map(int, input().split()) li = list(map(int, input().split())) for i in range(n - 1, 0, -1): for j in range(i): if li[j] > li[j + 1]: li[j], li[j + 1] = li[j + 1], li[j] k -= 1 if k == 0: print(f'{li[j]} {li[j + 1]}') exit() print(-1) 정렬

from itertools import combinations from bisect import bisect_left, bisect_right n, s = map(int, input().split()) li = list(map(int, input().split())) def find(li, s): return bisect_right(li, s) - bisect_left(li, s) def com(li): res = [] for i in range(1, len(li) + 1): for l in combinations(li, i): res.append(sum(l)) return sorted(res) left, right = li[:n // 2], li[n // 2:] com_left, com_right, =..

n = int(input()) li = list(map(int, input().split())) tree = [[] for _ in range(n)] root, count = 0, 0 rm = int(input()) for i in range(len(li)): if li[i] == -1: root = i elif i == rm: continue else: tree[li[i]].append(i) def dfs(node): global count if tree[node] == []: count += 1 for t in tree[node]: dfs(t) if rm == root: print(0) else: dfs(root) print(count) dfs

n = int(input()) board = [list(map(int, input().split())) for _ in range(n)] dp = [[[0] * 3 for _ in range(n)] for _ in range(n)] dp[0][1][0] = 1 for i in range(n): for j in range(1, n): if board[i][j - 1] != 1: dp[i][j][0] += dp[i][j - 1][0] if i > 0: dp[i][j][0] += dp[i][j - 1][2] if board[i - 1][j] != 1: dp[i][j][1] += dp[i - 1][j][1] if i > 0: dp[i][j][1] += dp[i - 1][j][2] if i > 0 and not ..

n = int(input()) left, right = 0, n while left