CCF201912-3 化学方程式

CCF201912-3 化学方程式

题目连接

化学方程式

100分代码

# 100
def solve(expr: str) -> dict:
    d = {}

    def add(k: str, v: int):
        if k not in d:
            d[k] = v
        else:
            d[k] += v

    def deal(formula: str, coef: int):
        num = 0
        element = ''
        i = 0
        while i < len(formula):
            if 'A' <= formula[i] <= 'Z':
                if element != '':
                    add(element, coef * max(1, num))
                    element = ''
                    num = 0
                element = formula[i]
                i += 1
            elif 'a' <= formula[i] <= 'z':
                element = element + formula[i]
                i += 1
            elif '0' <= formula[i] <= '9':
                num = num * 10 + int(formula[i])
                i += 1
            elif formula[i] == '(':
                if element != '':
                    add(element, coef * max(1, num))
                    element = ''
                    num = 0
                j = i
                j += 1
                matching = -1
                while matching != 0:
                    if formula[j] == '(':
                        matching -= 1
                    if formula[j] == ')':
                        matching += 1
                    j += 1
                t = j
                while t < len(formula) and '0' <= formula[t] <= '9':
                    num = num * 10 + int(formula[t])
                    t += 1
                deal(formula[i + 1:j - 1], max(1, num) * coef)
                num = 0
                i = t
        if element != '':
            add(element, coef * max(1, num))

    for formula in expr.split('+'):
        num = 0
        i = 0
        while i < len(formula):
            if not '0' <= formula[i] <= '9':
                deal(formula[i:], max(num, 1))
                break
            else:
                num = num * 10 + int(formula[i])
                i += 1
    return d


def main():
    n = int(input())
    for i in range(n):
        equation = input()
        left, right = equation.split('=')[0], equation.split('=')[1]
        d1, d2 = solve(left), solve(right)
        if len(d1) != len(d2):
            print('N')
        else:
            flag = True
            for k, v in d1.items():
                if k not in d2 or d2[k] != v:
                    print('N')
                    flag = False
                    break
            if flag:
                print('Y')


if __name__ == '__main__':
    main()


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值