OJ刷题记录：L1-802-一种高级的找零钱法(10分)

#include <iostream>
#include <vector>
#include <string>

using namespace std;

vector<int> convertToInt(string str) {
	string::iterator p = str.begin();
	string::iterator END = str.end();
	string value;
	vector<int> results;
	
	for (; p != END; p++) {
		value += *p;
		
		if (*p == '.' || p == END - 1) {
			results.emplace_back(atoi(value.c_str()));
			value = "";
		}
	}
	
	return results;
} 

string convertToGSK(int knut) {
	string result;
	int Galleon, Sickle, Knut;
	
	if (knut < 0) {
		knut = abs(knut);
		result += '-';
	}
	
	Galleon = knut / 493;
	Sickle = (knut - (Galleon * 493)) / 29;
	Knut = knut - (Galleon * 493) - (Sickle * 29);
	result = result + to_string(Galleon) + "." + to_string(Sickle) + "." + to_string(Knut);
	
	return result;
}

int main() {
	string Pstr, Astr, goal;
	int Pknut, Aknut, neededKnut;
	
	
	cin >> Pstr >> Astr;
	
	vector<int> P = convertToInt(Pstr);
	vector<int> A = convertToInt(Astr);
	
	Pknut = (P[0] * 493) + (P[1] * 29) + P[2];
	Aknut = (A[0] * 493) + (A[1] * 29) + A[2];
	
	if (Pknut == Aknut) {
		cout << "gang gang hao.";
		return 0;
	}
	
	neededKnut = Aknut - Pknut;
	
	goal = convertToGSK(neededKnut);
	
	cout << goal;
	
	return 0;
}