lab 11 v0.7, C (gcc)

Language: Layout:

//gcc 5.4.0

#include  <stdio.h>
#include  <string.h>
typedef struct{
        int n;
        int d;
    }fraction;
int add(fraction a,fraction b){ 
    int A,B,C,s;
    A=a.n*b.d;
    B=a.n*b.d;
    C=a.d*b.d;
    s=A+B;
    printf("{%d+%d)/%d=%d/%d",a,b,B,s,B);

}
int subtract(fraction a,fraction b){ 
    int A,B,C,s;
    A=a.n*b.d;
    B=a.n*b.d;
    C=a.d*b.d;
    s=A-B;
    printf("{%d+%d)/%d = %d/%d",A,B,C,s,B);

}
int multiply(fraction a,fraction b){ 
    int A,B;
    A=a.n*b.n;
    B=a.d*b.d;
    printf("{%d/%d)*(%d/%d) = %d/%d",a.n,a.d,b.n,b.d,A,B);
return(0);
                         }
int divide(fraction a,fraction b){ 
    int A,B;
    A=a.n*b.d;
    B=a.d*b.n;
    printf("{%d/%d)*(%d/%d) = %d/%d",a.n,a.d,b.n,b.d,A,B);

}
int main(void)
{
int o=0;
while(o<1){
    int c=0;
    fraction a;
    fraction b;
    //int v[4];
   scanf("%d",&c);
                           
    switch(c){
        case 1:
            scanf("%d",&a.n);
            scanf("%d",&a.d);
            scanf("%d",&b.n);
            scanf("%d",&b.d);
            add(a,b);
            continue;
        case 2:
            scanf("%d",&a.n);
            scanf("%d",&a.d);
            scanf("%d",&b.n);
            scanf("%d",&b.d);
            subtract(a,b);
            continue;
        
        case 3:
            scanf("%d",&a.n);
            scanf("%d",&a.d);
            scanf("%d",&b.n);
            scanf("%d",&b.d);
            multiply(a,b);
            continue;
        case 4:
            scanf("%d",&a.n);
            scanf("%d",&a.d);
            scanf("%d",&b.n);
            scanf("%d",&b.d);
            divide(a,b);
            continue;
        case 5:
             o++;
             return(0);
              }
          }
}

Show compiler warnings [ + ] Compiler args [ - ] Show input
Compilation time: 0.12 sec, absolute running time: 5.04 sec, cpu time: 4.99 sec, memory peak: 3 Mb, absolute service time: 5,26 sec