PAT(A) - 1058. A+B in Hogwarts (20)

1058. A+B in Hogwarts (20)

时间限制

50 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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

思路分析：一个金额计算问题，我的做法是统一换算成最小的单位，例如计算时间的时候，统一把小时、分钟都换成秒为单位的量。刚开始我整数类型用的int，有一个测试点不对，后来发现是数据溢出了，改成long long 就AC了。

#include <iostream>

using namespace std;

typedef struct {
    long long g;
    long long s;
    long long k;
} Money;

int main() {
    //freopen( "123.txt", "r", stdin );
    Money a, b, c;
    scanf( "%lld.%lld.%lld", &a.g, &a.s, &a.k );
    scanf( "%lld.%lld.%lld", &b.g, &b.s, &b.k );

    long long sum_a = a.g * 17 * 29 + a.s * 29 + a.k;
    long long sum_b = b.g * 17 * 29 + b.s * 29 + b.k;
    long long sum_c = sum_a + sum_b;

    c.g = sum_c / ( 17 * 29 );
    c.s = ( sum_c - ( c.g * 17 * 29 ) ) / 29;
    c.k = sum_c - c.g * ( 17 * 29 ) - c.s * 29;

    printf( "%lld.%lld.%lld", c.g, c.s, c.k );
    return 0;
}