PAT A1058 A+B in Hogwarts (20 分)

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

题意：

给定数据结构 a.b.c ,其中 b 为17进制数, c 为29进制数，求出两个该数据结构的和: a1.b1.c1 + a2.b2.c2 = a3.b2.c2

思路：

注意低位相加向高位的进位的条件：
(c1+c2)/29 != 0时需要进位，
(b1+b2)/17 != 0时需要进位.

代码：

#include <cstdio>
int main(){
	int a[3],b[3];
	scanf("%d.%d.%d %d.%d.%d",&a[0],&a[1],&a[2],&b[0],&b[1],&b[2]);
	printf("%d.%d.%d",a[0]+b[0]+(a[1]+b[1]+(a[2]+b[2])/29)/17,(a[1]+b[1]+(a[2]+b[2])/29)%17,(a[2]+b[2])%29);
	return 0;
}

词汇：

sliver 细片
compute 计算