PTA L1-009 N个数求和 (20 分) "Python3"

import enum
import os
class Fenshu(enum.Enum):
    Fenzi=0
    Fenmu=1
# 辗转相除法
def a(n1,n2):
    data=max(n1,n2)%min(n1,n2)
    if data!=0:
        result=a(min(n1,n2),data)
    else:
        return min(n1,n2)
    return result
data=int(input())

# 如果输入为0 直接结束程序
if data==0:
    print(0)
    os._exit(0)

datas=input().split()
# print(datas)
dicts=[[]*1000]*1000
# print(dicts)
for i in range(data):
    dicts[i]=datas[i].split("/")
# 将字典里的str转换为int 类型
dicts=[[int(x) for x in y]for y in dicts]
# print(dicts[0][Fenshu.Fenzi.value])
# g最大公约数
# 计数
count=0

result_fenzi=dicts[count][Fenshu.Fenzi.value]
result_fenmu=dicts[count][Fenshu.Fenmu.value]

while(True):
   # first_fenzi=dicts[count][Fenshu.Fenzi.value]
   # first_fenmu=dicts[count][Fenshu.Fenmu.value]

   next_fenzi=dicts[count+1][Fenshu.Fenzi.value]
   next_fenmu=dicts[count+1][Fenshu.Fenmu.value]