풀캠정글러

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 import sys input = sys.stdin.readline def DP(end) : for i in range(2, end+1) : TF0, TF1, TF2 = False, False, False if l1[i-1] + l1[i]

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 A = input() B = input() l = A + '1' + B lenl = len(l) rank = [ord(x) for x in l] def order(i) : if i >= lenl : return 0 return rank[i] suffix = [i for i in range(lenl)] pow2 = 1 newrank = [0 for i in range(lenl)] while pow2

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 import sys input = sys.stdin.readline n, k = map(int, input().split()) plug = list(map(int, input().split())) cons = [0 for i in range(n)] count = 0 for now in range(k) : TF = False for i in range(n) : if cons[i] == 0 or cons[i] == plug[now] : cons[i] = plug[now] TF = True break if TF : continue count = count ..

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 import sys input = sys.stdin.readline testcase = int(input()) for t in range(testcase) : n = int(input()) l = [] for i in range(n) : l.append(list(map(int, input().split()))) l.sort() top = sys.maxsize count = 0 for a, b in l : if b

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 import sys input = sys.stdin.readline n = int(input()) l = [] for i in range(n) : l.append(list(map(int, input().split()))) l.sort(key = lambda x : x[0]) l.sort(key = lambda x : x[1]) now = 0 count = 0 for start, end in l : if start >= now : count = count + 1 now = end print(count) Colored by Color Scripter cs IDEA 회의들을 종료점이 빠른 순서대로 (=일찍 끝나는 순서대로) 정렬한다. 시간 ..

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 l = input() i = 0 sum = 0 sign = 1 while i

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 import sys input = sys.stdin.readline from math import gcd n, k = map(int, input().split()) C = [] lcm = 1 maxc = 0 for i in range(n) : c = int(input()) C.append(c) lcm = lcm * c // gcd(lcm, c) maxc = max(maxc, c) cycle = lcm // maxc cycnt = (k // lcm) * cycle k = k % lcm count = [0 for i in range(k + 1)] for now in range..

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 import sys input = sys.stdin.readline from collections import defaultdict n, m = map(int, input().split()) TF = [True for i in range(n + 1)] for i in range(m) : TF[int(input())] = False jump = int((2 * n - 2) ** 0.5) + 1 DP = [[n for i in range(jump + 1)] for i in range(n + 1)] DP[1][0] = 0 for i in range(2, n+ 1) : if TF[i] : jum..

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 import sys input = sys.stdin.readline sys.setrecursionlimit(10**8) n = int(input()) W = [] for i in range(n) : W.append(list(map(int, input().split()))) max = sys.maxsize DP = [[max for i in range(1

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 import sys input = sys.stdin.readline n = int(input()) M = [] for i in range(n) : M.append(list(map(int, input().split()))) max = sys.maxsize DP = [[max for i in range(n)] for i in range(n)] for i in range(n) : DP[i][i] = 0 for len in range(1, n) : for i in range(n) : if i + len