pat 1058 A+B in Hogwarts（20 分）

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 Bare 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

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <stack>
#include <vector>
#include <queue>
#include <set>
#define LL long long
using namespace std;
const int MAX = 1e7 + 1;

int a1, a2, b1, b2, c1, c2, ans1 = 0, ans2 = 0, ans3 = 0, b = 0;

int main()
{
//    freopen("Date1.txt", "r", stdin);
    scanf("%d.%d.%d %d.%d.%d", &a1, &b1, &c1, &a2, &b2, &c2);
    ans3 += (c1 + c2) % 29, b = (c1 + c2) / 29;
    ans2 += (b + b1 + b2) % 17, b = (b + b1 + b2) / 17;
    ans1 += b + a1 + a2;
    printf("%d.%d.%d\n", ans1, ans2, ans3);
    return 0;
}