def solution(arr1, arr2):
h, w = len(arr1), len(arr1[0])
ans = [[arr1[i][j] + arr2[i][j] for j in range(w)] for i in range(h)]
return ans
def solution(phone_number):
return '*'*len(phone_number[:-4])+phone_number[-4:]
def solution(num):
answer = 0
while num != 1 :
if answer >= 500 :
return -1
if num % 2 == 0 :
num //= 2
else :
num = num*3 + 1
answer += 1
return answer
์ต๋๊ณต์ฝ์์ ์ต์๊ณต๋ฐฐ์
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