poj 分数求和

#include <iostream>
using namespace std;
int main() {
	int n, a, b, aSum, bSum;//分子为a，分母为b, aSum为分子和，bSum为分母和
	aSum = bSum = 1;
	cin >> n;
	scanf("%d/%d", &a, &b);
	aSum = a;
	bSum = b;
	for (int i = 1; i < n; i++) {
		scanf("%d/%d", &a, &b);
		aSum = aSum * b + bSum * a;
		bSum = bSum * b;
		for (int j = 10; j > 1; j--) {//将分子与分母除到最简形式
			if (( aSum % j == 0) &&(bSum % j == 0)) {
				aSum = aSum / j;
				bSum = bSum / j;
			}
		}
	}
	float k = (float)aSum / bSum - aSum / bSum;//判断一个数是否为整数
	if (k != 0)
		cout << aSum << "/" << bSum << endl;
	else
		cout << aSum / bSum << endl;
	return 0;
}