title: Program To Find Remainder Without Using Modulo Or Operator 1
signature: programToFindRemainderWithoutUsingModuloOrOperator1 :: Integer -> Integer -> Integer
  programToFindRemainderWithoutUsingModuloOrOperator1 num divisor = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Integer -> Integer -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: Integer -> Integer -> Integer -> String
  driver num divisor expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME num divisor) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver (34) (55) (34) )
  
      printf "TEST-1...%s\n" (driver (63) (22) (19) )
  
      printf "TEST-2...%s\n" (driver (15) (26) (15) )
  
      printf "TEST-3...%s\n" (driver (56) (58) (56) )
  
      printf "TEST-4...%s\n" (driver (63) (94) (63) )
  
      printf "TEST-5...%s\n" (driver (28) (45) (28) )
  
      printf "TEST-6...%s\n" (driver (54) (97) (54) )
  
      printf "TEST-7...%s\n" (driver (2) (58) (2) )
  
      printf "TEST-8...%s\n" (driver (94) (91) (3) )
  
      printf "TEST-9...%s\n" (driver (82) (40) (2) )
  
source_py: def program_to_find_remainder_without_using_modulo_or_operator_1(num, divisor):
      if (divisor == 0):
          return False
      if (divisor < 0):
          divisor = (- divisor)
      if (num < 0):
          num = (- num)
      i = 1
      product = 0
      while (product <= num):
          product = (divisor * i)
          i += 1
      return (num - (product - divisor))
source_cpp: int program_to_find_remainder_without_using_modulo_or_operator_1(int num, int divisor) {
    if ( divisor == 0 ) {
      return - 1;
    }
    if ( divisor < 0 ) divisor = - divisor;
    if ( num < 0 ) num = - num;
    int i = 1;
    int product = 0;
    while ( product <= num ) {
      product = divisor * i;
      i ++;
    }
    return num - ( product - divisor );
  }