Given N rational numbers in the form "numerator/denominator", you are supposed to calculate their sum.
Input Specification:
Each input file contains one test case. Each case starts with a positive integer N (<=100), followed in the next line N rational numbers "a1/b1 a2/b2 ..." where all the numerators and denominators are in the range of "long int". If there is a negative number, then the sign must appear in front of the numerator.
Output Specification:
For each test case, output the sum in the simplest form "integer numerator/denominator" where "integer" is the integer part of the sum, "numerator" < "denominator", and the numerator and the denominator have no common factor. You must output only the fractional part if the integer part is 0.
Sample Input 1:5 2/5 4/15 1/30 -2/60 8/3Sample Output 1:
3 1/3Sample Input 2:
2 4/3 2/3Sample Output 2:
2Sample Input 3:
3 1/3 -1/6 1/8Sample Output 3:
7/24
题目大意:
代码:
#include<stdio.h>
long long gcd(long long a,long long b)
{
if(b==0)
return a;
else
return gcd(b,a%b);
}
long long positiveInteger(long long n)
{
return n>0?n:-n;
}
int main()
{
long long i,j,n,m,k,t,numerators,denominators;
scanf("%lld",&n);
for(i=0;i<n;i++)
{
scanf("%lld/%lld",&k,&t);
if(i==0)
{
numerators=k;
denominators=t;
}
else
{
long long tmp=(denominators*t)/gcd(denominators,t);
numerators=numerators*(tmp/denominators)+k*(tmp/t);
denominators=tmp;
}
m=gcd(numerators,denominators);
numerators/=m;
denominators/=m;
}
if(positiveInteger(numerators)%denominators==0)
{
printf("%lld\n",numerators/denominators);
}
else
{
if(positiveInteger(numerators)>denominators)
{
printf("%lld ",numerators/denominators);
}
printf("%lld/%lld\n",numerators%denominators,denominators);
}
}