삽질 중에 최고의 삽질 개발자

def solution(a, b): min_range = min(a,b) max_range = max(a,b) if min_range != max_range: result = 0 for idx in range(min_range, max_range+1): result += idx return result else: return min_range

def solution(x): return True if (x % sum([ int(str(x)[idx]) for idx in range(len(str(x))) ])) == 0 else False

def solution(n): return int(''.join(sorted([ str(n)[idx] for idx in range(len(str(n)))], reverse=True)))

def solution(s): return int(s)

import math def solution(n): square = (math.sqrt(n)+1) if int(square) == square: return square*square if square >= 2 else -1 else: return -1

def solution(n): return [ int(str(n)[idx-1]) for idx in range(len(str(n)), 0, -1) ]

def solution(s): return True if s.count('p') + s.count('P') == s.count('y') + s.count('Y') else False

def solution(n): return min([ idx+1 for idx in range(n) if (n % (idx+1)) == 1 ])

def solution(x, n): return [ x*idx for idx in range(n+1) if idx != 0 ]

def solution(arr): return int(sum(arr)) / int(len(arr))