PAT 1058 A+B in Hogwarts [有进位的加法]

最新推荐文章于 2022-03-01 16:06:52 发布

DayDreammerⅠ

最新推荐文章于 2022-03-01 16:06:52 发布

阅读量136

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/Time504/article/details/86610069

版权

PAT 专栏收录该内容

100 篇文章 0 订阅

订阅专栏

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 Aand 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)).

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

我的代码：

#include<stdio.h>

int main()
{
	int a,b,c,d,e,f;
	scanf("%d.%d.%d %d.%d.%d",&a,&b,&c,&d,&e,&f);
	int m = 0,n = 0;
	int x1,x2,x3;
	if(c+f>=29)
	{
		x3 = c+f-29; //逢29进1 
		m++; //把进位存起来 
	}
	else x3 = c+f;
	//如果有进位m=1否则m=0，这里的比较需要加上进位
	if(b+e+m>=17)  
	{
		x2 = b+e+m-17;
		n++;
	}
	else x2 = b+e+m;
	x1 = a+d+n; //最高位没有进位，直接相加 
	printf("%d.%d.%d",x1,x2,x3);
}