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:
3.2.1 10.16.27
Sample Output:
14.1.28
//计算和需要进位,不能跟差那样简单转化为纳特
#include<cstdio>
int main(){
int a[3],b[3],c[3];//a,b数组存放输入的两个数,c数组存放结果
scanf("%d.%d.%d %d.%d.%d",&a[0],&a[1],&a[2],&b[0],&b[1],&b[2]);
int temp=0;//标志进位情况
c[2]=(a[2]+b[2])%29;
temp=(a[2]+b[2])/29;//从纳特到西可的进位
c[1]=(a[1]+b[1]+temp)%17;
temp=(a[1]+b[1]+temp)/17;//从西可到加隆的进位
c[0]=a[0]+b[0]+temp;//加隆最高位不用进位,直接加就可以了
printf("%d.%d.%d",c[0],c[1],c[2]);
return 0;
}