PAT A1058 A+B in Hogwarts (20分)

题目链接：https://pintia.cn/problem-sets/994805342720868352/problems/994805416519647232

题目描述
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)).

输入
Each input file contains one test case which occupies a line with A and B in the standard form, separated by one space.

输出
For each test case you should output the sum of A and B in one line, with the same format as the input.

样例输入
3.2.1 10.16.27

样例输出
14.1.28

代码

#include <cstdio>

struct money{
	long long g, s, k;
}a, b;

int main() {		
	scanf("%lld.%lld.%lld", &a.g, &a.s, &a.k);
	scanf("%lld.%lld.%lld", &b.g, &b.s, &b.k);
	long long sum1 = a.g * 17 * 29 + a.s * 29 + a.k;
	long long sum2 = b.g * 17 * 29 + b.s * 29 + b.k;
	long long sum3 = sum1 + sum2;
	printf("%lld.%lld.%lld\n", sum3 / 29 / 17, sum3 % (17 * 29) / 29, sum3 % (17 * 29) % 29 );
	return 0;
}

【注】：若不用long long 会有一个case错误；