Cod sursa(job #2592043)
Utilizator | Data | 31 martie 2020 23:37:40 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | py | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
fo = open("euclid2.in", "r")
next(fo)
fr = open("euclid2.out","w+")
def calc_euclid(a,b):
if a == 0:
return b
elif b== 0:
return a
elif a == b:
return a
else:
return calc_euclid(min(a,b),max(a,b)%min(a,b))
for line in fo:
a,b = [int(s) for s in line.split()]
fr.write(str(calc_euclid(a,b)) +"\n")
fo.close()
fr.close()