[Python/백준] #9613- [GCD 합]

[GCD 합]-9613번

9613번: GCD 합

My answer

import sys
import itertools

n,sums=int(input()),0

for i in range(n):
    tmp=list(map(int,sys.stdin.readline().split()))
    for j in itertools.combinations(tmp[1:], 2):
        a,b=max(j[0],j[1]),min(j[0],j[1])
        while(b!=0):
            a=a%b
            a,b=b,a
        sums=sums+a
    print(sums)
    sums=0

 

Another answer

from itertools import *
from math import gcd
for _ in range(int(input())):
    l = list(map(int, input().split()))[1:]
    print(sum(starmap(gcd, combinations(l,2))))