【PAT甲级A1058】A+B in Hogwarts (20分)（c++）

1058 A+B in Hogwarts (20分)

作者：CHEN, Yue
单位：浙江大学
代码长度限制：16 KB
时间限制：400 ms
内存限制：64 MB

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^​7​​ ], 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

题意：

29个Knut换一个Sickle，17个Sickle换一个Galleon，每位有不同的进制，根据不同的进制相加。

思路：

注意Galleon位并不是指10⁷进制，不作限制。

参考代码：

#include <iostream>
using namespace std;
int main() {
    int a[3],b[3],sum[3];
    scanf("%d.%d.%d",&a[0],&a[1],&a[2]);
    scanf("%d.%d.%d",&b[0],&b[1],&b[2]);
    sum[2]=a[2]+b[2];
    sum[1]=a[1]+b[1]+sum[2]/29;sum[2]=sum[2]%29;
    sum[0]=a[0]+b[0]+sum[1]/17;sum[1]=sum[1]%17;
    printf("%d.%d.%d\n",sum[0],sum[1],sum[2]);
    return 0;
}

如有错误，欢迎指正