PAT basic level 1037在霍格沃茨找零钱

#include<stdio.h>

int main(){
  long long int Galleon1,Galleon2,Sickle1,Sickle2,Knut1,Knut2,a1,a2,b,c,d;
  scanf("%lld.%lld.%lld",&Galleon1,&Sickle1,&Knut1);
  a1=Galleon1*17*29+Sickle1*29+Knut1;                         //转化为最小的，相当于把元角分全部换算成分
  scanf("%lld.%lld.%lld",&Galleon2,&Sickle2,&Knut2);
  a2=Galleon2*17*29+Sickle2*29+Knut2;
  if(a2>=a1){
    a1=a2-a1;
    b=a1%29;
    a1=a1/29;
    c=a1%17;
    d=a1/17;
    printf("%lld.%lld.%lld",d,c,b);
  }
  else{
    a1=a1-a2;
    b=a1%29;
    a1=a1/29;
    c=a1%17;
    d=a1/17;
    printf("-%lld.%lld.%lld",d,c,b);
  }
  return 0;
}

很简单的题目愣是想了半天，很多时候都不需要那些花里胡哨的东西，最朴素的纯C解决万物。