#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdio>
using namespace std;
long long int gcd(long long int a,long long int b)
{
return b==0 ? a : gcd(b,a%b);
}
long long int lcm(long long int a,long long int b)
{
if(a>=b)
return a/gcd(a,b)*b;
else
return b/gcd(b,a)*a;
}
int main()
{
char b;
long long int a,c;
int n;
cin>>n;
scanf("%lld%c%lld",&a,&b,&c);
long long z1=0;
if(a>c)
z1=gcd(a,c);
else
z1=gcd(c,a);
a=a/z1,c=c/z1;
for(int i=1;i<n;i++)
{
char e;
long long int d,f;
scanf("%lld%c%lld",&d,&e,&f);
long long int g=lcm(c,f);
long long int h=g*a/c,k=g*d/f;
c=g,a=h+k;
long long int z=0;
if(a>c)
z=gcd(a,c);
else
z=gcd(c,a);
a=a/z,c=c/z;
}
long long z=0;
if(a>c)
z=gcd(a,c);
else
z=gcd(c,a);
if(a==0)
printf("%d",0);
else
{
if(a/c==0)
printf("%lld/%lld",a/z,c/z);
else
{
if(a%c==0)
printf("%lld",a/c);
else
{
if(a/c<0)
{
if(a<0)
printf("%lld %lld/%lld",a/c*(-1),a%c,c);
else
printf("%lld %lld/%lld",a/c*(-1),a%(c*(-1))*(-1),c*(-1));
}
else
printf("%lld %lld/%lld",a/c,a%c,c);
}
}
}
return 0;
}
L1-009 N个数求和 天梯赛
猜你喜欢
转载自blog.csdn.net/Ls_attack/article/details/79822733
今日推荐
周排行