์ต๋๊ณต์ฝ์์ ์ต์๊ณต๋ฐฐ์
import math
def solution(a, b):
gcd_value = math.gcd(a, b) # ์ต๋๊ณต์ฝ์ ๊ณ์ฐ
lcm_value = (a * b) // gcd_value # ์ต์๊ณต๋ฐฐ์ ๊ณ์ฐ
return [gcd_value, lcm_value]
a, b = map(int, input().strip().split(' '))
answer = ('*' * a +'\n')*b
print(answer)
์ ์ผ ์์ ์ ์ ๊ฑฐํ๊ธฐ
def solution(arr):
arr.remove(min(arr))
return arr if arr else [-1]
def solution(n):
sqrt = n**0.5
return (sqrt+1)**2 if int(sqrt) == sqrt else -1
์ ์ ๋ด๋ฆผ์ฐจ์์ผ๋ก ๋ฐฐ์นํ๊ธฐ
def solution(n):
return int(''.join(sorted([x for x in str(n)], reverse = True)))
์์ฐ์ ๋ค์ง์ด ๋ฐฐ์ด๋ก ๋ง๋ค๊ธฐ
def solution(n):
return [int(x) for x in str(n)][::-1]
def solution(s):
s = s.lower().split(' ')
answer = ''
for word in s :
answer += ''.join(x.upper() if i % 2 == 0 else x for i, x in enumerate(word)) + ' '
return answer[:-1]