Yung_Developer

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 num_player = int(input()) player_list = [i for i in range(num_player)] player_ability_list = [] for player in range(num_player): player_ability_list.append(list(map(int, input().split()))) check_list=[False]*num_player output=[] diff = 1000000 def diff_set(pla..

# argument를 3개 사용한 경우 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 num = int(input()) num_list = list(map(int, input().split())) plus, minus, multi, division = map(int, input().split()) max_result = -1000000000 min_result = 1000000000 N = plus+minus+multi+division check_list = [False]*N count = 0 index = 0 result_list = [..

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 N, M = map(int, input().split()) check_list = [False]*N num_list = [i for i in range(1,N+1)] output = [] def permutation(count): if count == M: print(*output) return for i in range(N): if check_list[i] == True: continue output.append(num_list[i]) permutation(count+1) check_list[i] = True output.pop() for j in range(i+1,N): check_list..

123456789101112131415161718N, M = map(int, input().split()) num_list = [i for i in range(1,N+1)] output = [] def permutation(count): if count == M: print(*output) return for i in range(N): output.append(num_list[i]) permutation(count+1) output.pop() permutation(0)cs

# 직접 작성한 코드 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 N, M = map(int, input().split()) check_list = [False]*N num_list = [i for i in range(1,N+1)] output = [] result = [] def permutation(count): if count == M: if [*check_list] not in result: result.append([*check_list]) return for i in range(N): if check_list[i] == True: continue output.append(num_lis..

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 N, M = map(int, input().split()) check_list = [False]*N num_list = [i for i in range(1,N+1)] output = [] def permutation(count): if count == M: print(*output) return for i in range(N): if check_list[i] == True: continue output.append(num_list[i]) check_list[i] = True permutation(count+1) output.pop() check_list[i] = False permutation(0)..

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 import sys test_case = int(input()) members = [] count = 1 for case in range(test_case): age, name = sys.stdin.readline().strip().split() age = int(age) members.append([age, name, count]) count += 1 members = sorted(members, key=lambda x: (x[0], x[2])) for member in members: print(member[0], member[1]) cs

1 2 3 4 5 6 7 8 9 10 11 12 13 14 import sys test_case = int(input()) word_list = set() # 집합형 자료구조 사용 for case in range(test_case): word = sys.stdin.readline().strip() word_list.add(word) # set 자료구조에는 append가 아닌 add를 사용 # 단어의 길이로 정렬 + 길이가 같은 경우 사전순으로 word_list = sorted(word_list, key=lambda x: (len(x),x)) for word in word_list: print(word) Colored by Color Scripter cs # 중복된 단어 출력을 피하기 위해 set 자료구조..