PAT-1058 A+B in Hogwarts （进制转换）

1058. A+B in Hogwarts

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

水题，可能唯一要注意的就是不能把所有位转换到最低位，然后对两个数相加再转换回去，因为这种方法可能会溢出。只需要从低位到高位依次相加，考虑进位即可。

#include <cstdio>

int main(void) {

    int g1, s1, k1, g2, s2, k2, g3, s3, k3, t;

    scanf("%d.%d.%d %d.%d.%d", &g1, &s1, &k1, &g2, &s2, &k2);

    k3 = (k1 + k2) % 29;

    t = s1 + s2 + (k1 + k2) / 29;

    s3 = t % 17;

    g3 = g1 + g2 + t / 17;

    printf("%d.%d.%d\n", g3, s3, k3);

    return 0;

}

巴特西

PAT-1058 A+B in Hogwarts （进制转换）

最新文章

热门文章