1037 在霍格沃茨找零钱

题目链接：https://pintia.cn/problem-sets/994805260223102976/problems/994805284923359232

题解：

#include<iostream>
using namespace std;

int main() {
	int Galleon1, Sickle1, Knut1, Galleon2, Sickle2, Knut2;
	char c;
	cin >> Galleon1 >> c >> Sickle1 >> c >> Knut1 >> Galleon2 >> c >> Sickle2 >> c >> Knut2;
	int sum1 = Galleon1 * 17 * 29 + Sickle1 * 29 + Knut1;
	int sum2 = Galleon2 * 17 * 29 + Sickle2 * 29 + Knut2;
	int sum = sum2 - sum1;
	bool flag = false;
	if (sum < 0) {
		flag = true;
		sum = -sum;
	}
	if (flag) {
		cout << "-";
	}
	cout << sum / 29 / 17 << "." << sum / 29 % 17 << "." << sum % 29 << endl;
	return 0;
}