PAT(A) 1058. 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

#include <cstdio>
/*
a[0].a[1].a[2]      //第一个数 a[0]:[0, 10^7]  a[1]:[0, 17)  a[2]:[0, 29)
b[0].b[1].b[2]      //第二个数
c[0].c[1].c[2]      //求和
*/

int main()
{
    int a[3], b[3], c[3];
    scanf("%d.%d.%d", &a[0], &a[1], &a[2]);
    scanf("%d.%d.%d", &b[0], &b[1], &b[2]);

    int up=0;   //进位
    c[2]=(a[2]+b[2])%29;    //2号位结果
    up=(a[2]+b[2])/29;      //进位
    c[1]=(a[1]+b[1]+up)%17; //1号位结果
    up=(a[1]+b[1]+up)/17;   //进位
    c[0]=a[0]+b[0]+up;      //0号位结果

    printf("%d.%d.%d", c[0], c[1], c[2]);

    return 0;
}