patA1081 Rational Sum(20)

#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;


struct fraction{
ll up,down;
};
int gcd(int a,int b){
return b==0 ? a : gcd(b ,a % b);
}
fraction reduction(fraction x){   //take the & into consideration
if(x.up==0){
x.up=0;  x.down=1;
}else if(x.up<0){
x.up=-x.up;
x.down=-x.down;
}else{    
int d=gcd(x.up,x.down);                     //the value of x.up has changed;
x.up/=d;
x.down/=d;
}
return x;
}
fraction sum(fraction a,fraction b){
fraction c;
c.down=a.down*b.down;
c.up=a.up*b.down+b.up*a.down;
// reduction(c);
return reduction(c);
}
void print(fraction a){
if(a.down==1){
printf("%ld",a.up);
}else if(a.up>a.down){
printf("%ld %ld/%ld",a.up/a.down,a.up%a.down,a.down);
}else{
printf("%ld/%ld",a.up,a.down);
} 
}
int main(int argc, char** argv) {
int n;
scanf("%d",&n);
fraction temp;
temp.up=0;  temp.down=1;
fraction now;
for(int i=0;i<n;i++){
ll x1,y1;
scanf("%lld/%lld",&x1,&y1);
now.up=x1; now.down=y1;
temp=sum(temp,now);
}
print(temp);
return 0;
}