5. Sum of N numbers

#include<iostream>
using namespace std;
#include<algorithm>
/*int GCD(int a,int b)
{
    if(b==0)
        return a;
    else
        return GCD(b,a%b);
}*/
int main()
{
    int n,a,b,nume,deno,divisor;
    scanf("%d%d/%d",&n,&nume,&deno);
    for(int i=1;i<n;i++)
    {
        scanf("%d/%d",&a,&b);
        nume=nume*b+a*deno;
        deno=deno*b;
        divisor=__gcd(nume,deno);
        nume=nume/divisor;
        deno=deno/divisor;
    }
   /* if(deno<0)
    {
        deno=-deno;
        nume=-nume;
    }*/
    // There are molecules on it / The form of denominator , May be 1/1 This integer form , May be 1/5 This fraction form , special  0/8 This is an integer , also 5/3 such 
    if(nume&&nume/deno==0)   // For the score    // Note that the molecules are not 0 And molecules / The denominator is 0, So the number is a fraction 
        printf("%d/%d",nume,deno);
    else if(nume%deno==0)       // Only integer 
        printf("%d\n",nume/deno);
    else        
        printf("%d %d/%d\n",nume/deno,nume%deno,deno);
    return 0;
}

special 0/8 This is an integer

if(nume&&nume/deno==0)