PAT甲级真题 1018 A+B in Hogwarts--python解法

最新推荐文章于 2024-07-04 16:47:20 发布

zhangpeterx

最新推荐文章于 2024-07-04 16:47:20 发布

阅读量301

点赞数

CC 4.0 BY-SA版权

分类专栏： python-做题

本文链接：https://blog.youkuaiyun.com/zhangpeterx/article/details/88364321

python-做题同时被 2 个专栏收录

100 篇文章

订阅专栏

PAT详解

2 篇文章

订阅专栏

本文针对PAT甲级真题1018A+BinHogwarts进行了解析，该题涉及哈利波特魔法世界中的货币系统，即十七银西可兑换一金加隆，二十九纳特兑换一银西可。文章提供了一个Python代码示例，用于计算两个以金加隆.银西可.纳特形式给出的数值之和，并将结果以相同格式输出。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

PAT甲级真题 1018 A+B in Hogwarts

提交：2638
通过：1559
通过率：59%

If you are a fan of Harry Potter, you would know the world of magic has its own currency system – as Hagrid explained it to Harry, “Seventeen silver Sickles to a Galleon and twenty-nine Knuts to a Sickle, it’s easy enough.” Your job is to write a program to compute A+B where A and B are given in the standard form of “Galleon.Sickle.Knut” (Galleon is an integer in [0, 107], Sickle is an integer in [0, 17), and Knut is an integer in [0, 29)).

输入描述:
Each input file contains one test case which occupies a line with A and B in the standard form, separated by one space.

输出描述:
For each test case you should output the sum of A and B in one line, with the same format as the input.

输入例子:

3.2.1 10.16.27

输出例子:

14.1.28

这道题很简单，就是进制转换的问题：
Python代码如下：

x=input().strip().split(' ')
a=x[0].split('.')
b=x[1].split('.')
c=[0,0,0]
c[2]=int(a[2])+int(b[2])
if c[2]>=29:
    c[1]+=c[2]//29
    c[2]=c[2]%29
c[1]+=int(a[1])+int(b[1])
if c[1]>=17:
    c[0]+=c[1]//17
    c[1]=c[1]%17
c[0]+=int(a[0])+int(b[0])
print(c[0],c[1],c[2],sep='.')