PAT 1058

• 题目：
  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​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

• 解题思路
  用tag记录是否进位。若进位，则tag =1;否则tag = 0;
  代码实现：

#include <iostream>
#include <cstdio>
using namespace std;
struct Node{
    int a;
    int b;
    int c;
}A,B, res;
int main()
{
    scanf("%d.%d.%d",&A.a, &A.b, &A.c);
    scanf("%d.%d.%d",&B.a, &B.b, &B.c);
    int tag = 0;
    if(A.c + B.c < 29){
        res.c = A.c + B.c;
        tag = 0;
    } else {
        res.c = (A.c + B.c) %29;
        tag =1;
    }
     if(A.b + B.b + tag < 17){
        res.b = A.b + B.b + tag;
        tag = 0;
    } else {
        res.b = (A.b + B.b + tag) %17;
        tag = 1;
    }
    res.a = A.a + B.a +tag;
    cout << res.a <<"." << res.b <<"." << res.c;
    return 0;
}