-
12345678910def solution(n): nlist = list(map(int,str(n))) nlist.sort(); nlist.reverse(); temp = ""; for i in nlist: temp += str(i); return int(temp);cs
123456789def solution(n): i = 1; while True: if i ** 2 == n: return (i+1)**2; if i ** 2 > n: return -1; i += 1;cs
123456789import numpy as np;def solution(arr): if len(arr)
12345678910111213import numpy as np;def solution(n, m): answer = []; gcd = int(np.gcd(n,m)); lcm = int(np.lcm(n,m)); answer.append(gcd); answer.append(lcm); print(answer) return answer;cs
1234567891011121314def solution(num): proc = 0; while proc
123def solution(arr): return sum([i for i in arr]) / len(arr);cs
123456789def solution(x): div = 0; for i in str(x): div += int(i); if x % div == 0: return True; else: return False;cs
1234567def solution(phone_number): answer = ''; for i in range(0,(len(phone_number)-4)): answer += "*"; answer = answer + phone_number[-4:]; return answer;cs