title: Program To Find Remainder Without Using Modulo Or Operator
signature: function program_to_find_remainder_without_using_modulo_or_operator(num, divisor)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(num, divisor, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(num, divisor), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(80, 54, 26);
      @printf("TEST-0...%s\n",result);
      
      result = driver(63, 21, 0);
      @printf("TEST-1...%s\n",result);
      
      result = driver(1, 56, 1);
      @printf("TEST-2...%s\n",result);
      
      result = driver(22, 39, 22);
      @printf("TEST-3...%s\n",result);
      
      result = driver(66, 7, 3);
      @printf("TEST-4...%s\n",result);
      
      result = driver(61, 67, 61);
      @printf("TEST-5...%s\n",result);
      
      result = driver(45, 63, 45);
      @printf("TEST-6...%s\n",result);
      
      result = driver(29, 44, 29);
      @printf("TEST-7...%s\n",result);
      
      result = driver(95, 65, 30);
      @printf("TEST-8...%s\n",result);
      
      result = driver(9, 68, 9);
      @printf("TEST-9...%s\n",result);
      
  end
  
  main()
source_py: def program_to_find_remainder_without_using_modulo_or_operator(num, divisor):
      return (num - (divisor * (num // divisor)))
source_cpp: int program_to_find_remainder_without_using_modulo_or_operator(int num, int divisor) {
    return ( num - divisor * ( num / divisor ) );
  }