L1-009 N个数求和（C++）

一 、链接 

L1-009 N个数求和

二、题目

三、代码

#include<bits/stdc++.h>

using namespace std;

int main()
{
	long long int n=0;
	long long int molecule[200];//分子 
	long long int denominator[200];//分母 
	long long int max_gcd=0,min_mul=0;
	long long int a,b; 
	scanf("%lld",&n);
	for(int i=0;i<n;i++)
	{
		scanf("%lld/%lld",&molecule[i],&denominator[i]);
	}
	for(int j=0;j<n-1;j++)
	{
		a=denominator[j];
		b=denominator[j+1];
		max_gcd=__gcd(a,b);
		min_mul=(denominator[j]*denominator[j+1])/max_gcd;
		molecule[j+1]=(min_mul/denominator[j]*molecule[j])+(min_mul/denominator[j+1]*molecule[j+1]);
		denominator[j+1]=min_mul;
	}
	if(molecule[n-1]/denominator[n-1]!=0)
	{
		if(molecule[n-1]%denominator[n-1]==0)
		printf("%lld",molecule[n-1]/denominator[n-1]);
		else
		{
			printf("%lld ",molecule[n-1]/denominator[n-1]);
			printf("%lld/%lld",(molecule[n-1]%denominator[n-1])/__gcd(molecule[n-1],denominator[n-1]),denominator[n-1]/__gcd(molecule[n-1],denominator[n-1]));
		}
		
	}
	else if(molecule[n-1]==0)
	{
		printf("0");
	}
	else 
		printf("%lld/%lld",molecule[n-1]/__gcd(molecule[n-1],denominator[n-1]),denominator[n-1]/__gcd(molecule[n-1],denominator[n-1]));
	return 0;
}