Algorithm-Problems/백준
[백준][9613] GCD 합
프리랜서를꿈꾸는자
2022. 5. 8. 16:36
728x90
- 문제
- 해결
import sys
test_case_count = int(sys.stdin.readline())
def get_gcd(m, n):
if n > m:
m, n = n, m
if n == 0:
return m
else:
return get_gcd(n, m % n)
for i in range(test_case_count):
numbers = [int(x) for x in sys.stdin.readline().split()][1:]
res = 0
for j in range(0, len(numbers) - 1, 1):
for k in range(1, len(numbers) - j, 1):
res += get_gcd(numbers[j], numbers[j + k])
print(res)
- 포인트
- 쉬움
728x90