#include <stdio.h>
#include <math.h>
long long int Gcd(long long int a,long long int b)
{
if(a%b==0) return b;
else
return Gcd(b,a%b);
}
long long int Lcm(long long int a,long long int b)
{
long long int tmp=a*b;
return tmp/Gcd(a,b);
}
int main()
{
int n;
long long int num[101];
long long int den[101];
long long int c[101];
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%lld/%lld",&num[i],&den[i]);
}
long long int max=den[0];
for(int i=0;i<n-1;i++)
{
if(max<Lcm(max,den[i+1]))
max=Lcm(max,den[i+1]);
}
int count =0;
for(int i=0;i<n;i++)
{
c[i]=max/den[i];
num[i]*=c[i];
count+=num[i];
}
long long int gc=Gcd(count,max);
long long int num1,den1;
num1=count/gc;
den1=max/gc;
if(den1<0)
den1=-den1;
if(num1>den1)
{printf("%lld",num1/den1);
if(num1%den1!=0)
printf(" %lld/%lld",num1%den1,den1);}
else
if(num1==den1)
printf("1");
else
if(num1%den1!=0)
printf("%lld/%lld",num1,den1);
else
printf("0");
}
不晓得哪里错了。。。
1081. Rational Sum (20)
最新推荐文章于 2020-07-08 15:34:58 发布