시나위

def solution(numbers, target): answer_list=[0] for i in numbers: temporary_list=[] #print("\nanswer_list:",answer_list) for j in answer_list: temporary_list.append(j+i) temporary_list.append(j-i) #print("tmp_list",temporary_list) answer_list=temporary_list #print("answer_list",answer_list) answer = answer_list.count(target) return answer 방법은 똑같았으나 구현하지 못해 내 코드는 아니지만 올린다.

def solution(clothes): answer = 1 tmp={} for cloth in clothes: if cloth[1] in tmp: tmp[cloth[1]]+=1 else: tmp[cloth[1]]=1 for k in tmp.values(): answer*=k+1 return answer-1

from itertools import permutations def solution(baseball): answer = 0 correct=list(permutations([1,2,3,4,5,6,7,8,9], 3)) for i in range(len(baseball)): tmp=tuple(map(int,list(str(baseball[i][0])))) #print("tmp:",tmp) cr_num=0 try: while correct!=[]: st_chk=0 b_chk=0 #check strike and ball if tmp[0]==correct[cr_num][0]: st_chk+=1 elif tmp[0]==correct[cr_num][1]: b_chk+=1 elif tmp[0]==correct[cr_n..

from itertools import permutations def solution(numbers): answer = 0 ## permutation of elements of numbers c_arr = list(set(map(int, [''.join(j) for i in range(len(numbers)) for j in permutations(numbers, i+1)]))) ## Sieve of Eratosthenes prime_num=[] max_arr=max(c_arr) chk=[False]*2+[True]*(max_arr-1) for i in range(2,max_arr+1): if chk[i]: prime_num.append(i) for j in range(2*i,max_arr+1,i): i..

def solution(bridge_length, weight, truck_weights): answer = 0 ing=[] # 다리를 건너는 트럭 cnt=[] # 트럭당 지난 거리 ed=[] # 다리를 지난 트력 while 1: if (truck_weights == []) and (ing == []): break answer+=1 # count total time for i in range(len(cnt)): # decrease the times of trucks above the bridge cnt[i]-=1 if (cnt!=[])and(cnt[0]==0): ed.append(ing[0]) del cnt[0] del ing[0] if (sum(ing) max_weight: bridge.append(0..