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
简单题,但是要考虑到在全部转化为knut的情况下,可能会超出int范围,所以用longlongint来存,也可以不转化为knut,直接对每一位进行加法然后进制处理
#include<cstdio>
using namespace std;
int main(){
long long int g1,s1,k1,g2,s2,k2;
long long int sum = 0;//全部转化为knut先
scanf("%lld.%lld.%lld %lld.%lld.%lld",&g1,&s1,&k1,&g2,&s2,&k2);
sum = (g1+g2) * 17 * 29 + (s1+s2) * 29 + k1+ k2;
long long int g = 0, s = 0, k = 0;
g = sum /29 / 17;
s = (sum - g * 29 *17)/29;
k = (sum - g * 29 * 17 - s * 29) % 29;
printf("%lld.%lld.%lld\n",g,s,k);
return 0;
}