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], 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
 
题目分析:进制转化

 #define _CRT_SECURE_NO_WARNINGS
 #include <climits>
 #include<iostream>
 #include<vector>
 #include<queue>
 #include<map>
 #include<set>
 #include<stack>
 #include<algorithm>
 #include<string>
 #include<cmath>
 using namespace std;
 long long N1[];
 long long N2[];
 long long Flag[];
 long long C[] = { ,, };
 int main()
 {
     scanf("%lld.%lld.%lld %lld.%lld.%lld", &N1[], &N1[], &N1[], &N2[], &N2[], &N2[]);
     for (long long i = ; i >=; i--)
     {
         N1[i] += N2[i] + Flag[i];
         if (N1[i] >=C[i]&&i!=)
         {
             Flag[i - ] = N1[i]/C[i];
             N1[i] %= C[i];
         }
     }
     printf("%lld.%lld.%lld", N1[], N1[], N1[]);
 }