My answer📝 : error def solution(arr, divisor): a = [] num = 0 for i in divisor: if arr%i == 0: a.sort(i) num += 1 answer = a if num == 0: answer = -1 return answer Others' answer🤓: works! def solution(arr, divisor): a = [] num = 0 for i in arr: if i%divisor == 0: a.append(i) answer = a if len(a) == 0: answer = [-1] return list(sorted(answer)) Today I Learned💪🏽 indent def 아랫줄부터는 꼭 주기 처음 answer 는 ..

My answer📝 : error def solution(x): sum = sum(map(int, str(x))) for i in range (1, x+1): if x%i == 0: answer = True return answer Others' answer🤓 : 참고했으나 programmers 상에서는 error def solution(x): arr = list(str(x)) sum = 0 for i in range (len(arr)): sum += int(arr[i]) if x%sum == 0: answer = True else: answer = False return answer def Harshad(n): return n % sum([int(c) for c in str(n)]) == 0 My fi..

My answer📝 : error def solution(n): i = 0 while n != 1 and i=500: answer = -1 else: answer = 0 return answer Others' answer🤓 def solution(num): for i in range(500): num = num /2 if num%2 == 0 else num*3+1 if num == 1: return i + 1 return -1 왜돼지? 처음에 i가 0부터 시작해서 시도를 할때마다 i가 늘어나는 게 아닌것 같은데… i

자연수 뒤집어 배열로 만들기 def solution(n): arr = list(str(n)) arr.reverse() return list(map(int,arr))