pat a1058 a+b in hogwarts

题目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,107], 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:

1
3.2.1 10.16.27

Sample Output:

1
14.1.28

题意

  对两个格式为Galleon.Sickle.Knut的数据进行加和后按格式进行输出。

思路

  用一个函数$H(x)=Galleon times 17 times 29 + Sickle times 29 + Knut$将该格式的数据转化成实数。注意数据会爆int要用long long类型。

代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16

#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
const long long Galleon=17*29;
const long long Sickle=29;
int (){
long long a1,b1,c1,a2,b2,c2,num1,num2;
scanf("%lld.%lld.%lld %lld.%lld.%lld",&a1,&b1,&c1,&a2,&b2,&c2);
num1=a1*Galleon+b1*Sickle+c1;
num2=a2*Galleon+b2*Sickle+c2;
long long sum=num1+num2;
printf("%lld.%lld.%lldn",sum/Galleon,sum%Galleon/Sickle,sum%Sickle);
return 0;
}