takeU

def ccw(x1, y1, x2, y2, x3, y3): c = (x2 - x1) * (y3 - y1) - (y2 - y1) * (x3 - x1) return c > 0 def convex_hull(positions): convex = [] for p3 in positions: while len(convex) >= 2: p1, p2 = convex[-2], convex[-1] if ccw(*p1, *p2, *p3): break convex.pop() convex.append(p3) return len(convex) n = int(input()) positions = sorted([list(map(int, input().split())) for _ in range(n)], key=lambda x: (x[..

from math import factorial n = int(input()) board = [list(map(int, input().split())) for _ in range(5)] print(factorial(2 * n) // (factorial(n) ** 2) % 1000000007, n ** 2)

from math import factorial n = int(input()) board = [list(map(int, input().split())) for _ in range(5)] print(factorial(2 * n) // (factorial(n) ** 2), n ** 2) 수학

n = int(input()) x, y = 1, 1 for _ in range(n-2): y, x = (x + y) % 1000000007, y print(y, n - 2)

n = int(input()) ans = [0, 1] dp_li = [0, 1, 1] def recur(n): global ans if n < 3: ans[0] += 1 return 1 else: return recur(n - 1) + recur(n - 2) def dp(n): global ans, dp_li if n < 3: return dp_li[n] for i in range(3, n): ans[1] += 1 dp_li.append(dp_li[i - 1] + dp_li[i - 2]) return dp_li[-1] recur(n) dp(n) print(*ans) pypy제출코드 dp

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) 정렬