PTA L1-009 N个数求和 (20 分)

L1-009 N个数求和 (20 分)

#include <bits/stdc++.h>
using namespace std;
int f1(long x,long y){
	while (x%y!=0){
		int z=y;
		y=x%y;
		x=z;
	}
	return y;
}
long fenzi=0,fenmu=1;
void sum(long x,long y){
	long a=fenzi*y+fenmu*x;
	long b=fenmu*y;
	long c=f1(a,b);
	fenzi=a/c;
	fenmu=b/c;
}
int main()
{
	int n;
	cin>>n;
	int i;
	char c;
	for (i=0;i<n;i++){
		long x,y;
		cin>>x>>c>>y;
		sum(x,y);
	}
	if(fenzi%fenmu==0){
		cout<<fenzi/fenmu<<endl;
	}
	else if(fenzi>fenmu){
		cout<<fenzi/fenmu<<" "<<fenzi%fenmu<<"/"<<fenmu<<endl;
	}
	else {
		cout<<fenzi<<"/"<<fenmu<<endl;
	}
	return 0;
}