PTA 乙级 1034 有理数四则运算 Python 实现

个人独立实现，转载请附上链接

首先用了求最大公约数和最小公倍数的两个函数，自己忘了怎么写，也懒得写了，直接让cursor(GPT实现)写了一下，看图， 哈哈，偷懒挺会的，要不是cursor不会写PTA 1034，不然就没这篇了[捂脸笑]

总共自己写了两个方法

一、show（打印值）

二、simplify（化简分数）

具体代码实现看下面吧 

def gcd(a, b):
    if b == 0:
        return a
    else:
        return gcd(b, a % b)

def lcm(a, b):
    return a * b // gcd(a, b)

def show(s):
    wei = s.find('/')
    negative = False
    member = int(s[:wei])
    denominator = int(s[wei+1:])
    if member < 0:
        negative = True
        member = -member

    if negative:    print('(-', end='')
 
    if member == 0: print(0, end='')
    if member // denominator != 0:
        print(member // denominator,end='')
    if member % denominator != 0:
        if member // denominator != 0:
            print(' ', end='')
        print(f'{member % denominator}/{denominator}', end='')

    if negative:    print(')', end='')

def simplify(a, b):#传入一个分数，化简该分数，并返回分数的字符串形式
    temp = gcd(a, b)
    while temp != 1:
        a = a // temp
        b = b // temp
        temp = gcd(a, b)
    return str(int(a)) + '/' + str(int(b))


front, tail = input().split()

loc_front = front.find('/')
loc_tail = tail.find('/')

front_member = int(front[:loc_front])
front_denominator = int(front[loc_front+1:])
tail_member = int(tail[:loc_tail])
tail_denominator = int(tail[loc_tail+1:])

least = lcm(front_denominator, tail_denominator)

#处理加法

result_member = front_member*least//front_denominator + tail_member*least//tail_denominator
show(simplify(front_member, front_denominator))
print(' + ', end='')
show(simplify(tail_member, tail_denominator))
print(' = ', end='')
show(simplify(result_member, least))
print()

#处理减法

result_member = front_member*least//front_denominator - tail_member*least//tail_denominator
show(simplify(front_member, front_denominator))
print(' - ', end='')
show(simplify(tail_member, tail_denominator))
print(' = ', end='')
show(simplify(result_member, least))
print()

#处理乘法

show(simplify(front_member, front_denominator))
print(' * ', end='')
show(simplify(tail_member, tail_denominator))
print(' = ', end='')
show(simplify(front_member*tail_member, front_denominator*tail_denominator))
print()

#处理除法

show(simplify(front_member, front_denominator))
print(' / ', end='')
show(simplify(tail_member, tail_denominator))
print(' = ', end='')
if tail_member != 0:
    show(simplify(front_member*tail_denominator, front_denominator*tail_member))
else:
    print('Inf', end='')
print()