1058. A+B in Hogwarts (20)

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

Sweety米修

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

阅读量707

点赞数

分类专栏： PAT 文章标签： PAT

本文链接：https://blog.csdn.net/zjujqq/article/details/10414967

版权

PAT 专栏收录该内容

12 篇文章 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 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

来源：http://pat.zju.edu.cn/contests/pat-a-practise/1058

题意
给定的数的结构如下：a.b.c，其中 a 的范围是 [0, 107]，b 的范围是 [0,17)，c 的范围是 [0,29)。给定两个数，要求计算他们的和。
分析
简单模拟题，有一个坑：题目交代最高位的区间为 [0, 100000000]，但是没说如果两数相加超过这个值怎么办。需要将最高位的结果区间设定为 20000000 以上才 AC。
#include<iostream>
#include<string.h>
#include<stdio.h>
using namespace std;
int main()
{
	long a[3];
	long b[3];
	scanf("%ld.%ld.%ld",&a[0],&a[1],&a[2]);
	scanf("%ld.%ld.%ld",&b[0],&b[1],&b[2]);
	int tmp;
	tmp=a[2]+b[2];
	if(tmp>=29){
		a[2]=tmp-29;
		a[1]++;
	}
	else
		a[2]=tmp;
	tmp=a[1]+b[1];
	if(tmp>=17){
		a[1]=tmp-17;
		a[0]++;
	}
	else
		a[1]=tmp;
	a[0]+=b[0];
	int i=0;
	cout<<a[0]<<"."<<a[1]<<"."<<a[2]<<endl;
	return 0;
}