【PAT B 1037】在霍格沃茨找零钱

#include <cstdio>
#include <cmath>
using namespace std;
const int maxn = 1005;
int main() {
    int galleon[2],sickle[2],knut[2];
    int change[2] = {0},number;
    bool isneg = false;
    scanf("%d.%d.%d",&galleon[0],&sickle[0],&knut[0]);
    scanf("%d.%d.%d",&galleon[1],&sickle[1],&knut[1]);
    for(int i = 0;i < 2;i++){
        change[i] = knut[i] + sickle[i] * 29 + galleon[i] * 17 * 29;
    }
    number = change[1] - change[0];
    if(number < 0){
        number *= -1;
        isneg = true;
    }
    if(isneg){
        printf("-");
        printf("%d.%d.%d",(number/29)/17,(number/29)%17,number%29);
    } else
        printf("%d.%d.%d",(number/29)/17,(number/29)%17,number%29);
    return 0;
}