A1058. A+B in Hogwarts (20)

最新推荐文章于 2024-02-21 16:28:06 发布

privilage

最新推荐文章于 2024-02-21 16:28:06 发布

阅读量190

点赞数

CC 4.0 BY-SA版权

分类专栏： PAT A

本文链接：https://blog.youkuaiyun.com/privilage/article/details/79953193

PAT A 专栏收录该内容

13 篇文章

订阅专栏

本文介绍了一种基于《哈利·波特》系列中魔法世界的货币系统的简单计算程序。该程序能够处理两个以“加隆.西可.纳特”形式给出的数值，并计算它们的和。文章提供了完整的C语言代码实现，通过数组存储并使用取模和整除运算来完成进位计算。

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

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, 10⁷], Sickle is an integer in [0, 17), and Knut is an integer in [0, 29)).

Input Specification:

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

Output Specification:

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

Sample Input:

3.2.1 10.16.27

Sample Output:

14.1.28

题目大意：

利用霍格沃兹的货币系统，对两个数据进行相加，求出之后的值；

与B1037类似。

思路：

用数组存储，利用取模和整取运算进行进位；

代码如下：

#include <cstdio>

int main()
{
	int a[3], b[3], c[3];
	scanf ("%d.%d.%d %d.%d.%d", &a[0], &a[1], &a[2], &b[0], &b[1], &b[2]);
	
	int carry = 0;
	c[2] = (a[2] + b[2]) % 29;
	carry = (a[2] + b[2]) / 29;			//获取进位； 
	c[1] = (a[1] + b[1] + carry) % 17;
	carry = (a[1] + b[1] + carry) / 17;		//carry值也要加入计算； 
	c[0] = a[0] + b[0] + carry;
	
	printf ("%d.%d.%d", c[0], c[1], c[2]);
 	return 0;
}