URI Online Judge Solution 1022 TDA Rational - Solution in C, C++ | Data structures

URI Online Judge Solution 1022 TDA Rational - Solution in C, C++ | Data structures

URI Online Judge Solution 1022 TDA Rational
URI Main Problem Link - https://www.urionlinejudge.com.br/judge/en/problems/view/1022

Problem Name: URI Problem 1022 TDA Rational
Problem Number : URI Problem 1022 TDA Rational Solution
Online Judge : URI Online Judge Solution
Level: Data structures
Solution Language : C, C plus plus

URI Solution 1022 TDA Rational Code in CPP:

#include <cstdio>
using namespace std;

int euclides(int a, int b)
{
 int divisor, dividendo, c;

 if(a == 0)
  return 1;

 if(b > a){
  dividendo = b;
  divisor = a;
 }else{
  dividendo = a;
  divisor = b;
 }

 while(dividendo % divisor != 0)
 {
  c = dividendo % divisor;
  dividendo = divisor;
  divisor = c;
 }
 return divisor;
}

int main()
{
 char c1, c2, c3;
 int n, N1, N2, D1, D2, num, den, numS, denS, e;
 scanf("%i", &n);

 for (int i = 0; i < n; ++i)
 {
  scanf("%i %c %i %c %i %c %i", &N1, &c1, &D1, &c2, &N2, &c3, &D2);
  if(c2 == '+'){
   num = ((N1 * D2) + (N2 * D1));
   den = (D1 * D2);
  }else if(c2 == '-'){
   num = ((N1 * D2) - (N2 * D1));
   den = (D1 * D2);
  }else if(c2 == '*'){
   num = (N1 * N2);
   den = (D1 * D2);
  }else{
   num = (N1 * D2);
   den = (N2 * D1);
  }

  e = euclides(num, den);
  numS = num / e; 
  denS = den / e;

  if(numS > 0 && denS > 0){
   printf("%i/%i = %i/%i\n", num, den, numS, denS);
  }else{
   if(denS < 0){
    denS = -denS;
    numS = -numS;
   }
   printf("%i/%i = %i/%i\n", num, den, numS, denS);
  }
 }

 return 0;
}