PAT甲级——A1058 A+B in Hogwarts

Posted zzw1024

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了PAT甲级——A1058 A+B in Hogwarts相关的知识,希望对你有一定的参考价值。

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], 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


 1 #include <iostream>
 2 using namespace std;
 3 int main()
 4 
 5     int A[3], B[3], C[3], s = 0;
 6     scanf("%d.%d.%d", &A[0], &A[1], &A[2]);
 7     scanf("%d.%d.%d", &B[0], &B[1], &B[2]);
 8     C[2] = (A[2] + B[2] + s) % 29;
 9     s = (A[2] + B[2] + s) / 29;
10     C[1] = (A[1] + B[1] + s) % 17;
11     s = (A[1] + B[1] + s) / 17;
12     C[0] = A[0] + B[0] + s;
13     printf("%d.%d.%d\n", C[0], C[1], C[2]);
14     return 0;
15 

 

以上是关于PAT甲级——A1058 A+B in Hogwarts的主要内容,如果未能解决你的问题,请参考以下文章

PAT A1058 A+B in Hogwarts (20)[进制转换]

PAT 甲级 1058 A+B in Hogwarts (20 分) (简单题)

PAT甲级——A1151 LCA_in_a_BinaryTree30

PAT 甲级1151 LCA in a Binary Tree (30 分)

PAT-甲级-1001-A+B Format

PAT甲级 1001. A+B Format (20)