42. 최대공약수와 최소공배수
코딩테스트 연습 > 연습문제 > 최대공약수와 최소공배수
https://programmers.co.kr/learn/courses/30/lessons/12940
Input value =
Output value =
ㆍ 두 수는 1이상 1,000,000이하의 자연수다.
#00
n,m = 3,12
#01-1
from math import gcd,lcm
[gcd(n,m),lcm(n,m)]
#01-2
for i in range(1,max(n,m)+1):
if n%i==0 and m%i==0:
gcd = i
for i in range(max(n,m),n*m+1):
if i%n==0 and i%m==0:
lcm = i
break
#02
[gcd,lcm]
from math import gcd,lcm
def solution(n,m):
return [gcd(n,m),lcm(n,m)]
# Code test
n,m = 3,12
solution(n,m)
def solution(n,m):
for i in range(1,max(n,m)+1):
if n%i==0 and m%i==0:
gcd = i
for i in range(max(n,m),n*m+1):
if i%n==0 and i%m==0:
lcm = i
break
return [gcd,lcm]
# Code test
n,m = 3,12
solution(n,m)