title: Program To Find Remainder Without Using Modulo Or Operator
signature: fun programToFindRemainderWithoutUsingModuloOrOperator(num: Int, divisor: Int): Int {
test_code: package main
  
  import kotlin.text.*
  import kotlin.math.*
  
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  fun validateSolution(actual:Int, expected:Int):Boolean{
    return actual.equals(expected)
  }
  fun driver(num: Int, divisor: Int, expected:Int):String {
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME(num, divisor), expected)) {
                return "PASSED"
        }
        return "FAILED"
      } catch (e: Exception){
        return e::class.simpleName as String
      }
  
  }
  
  fun main() {
      var result: String = ""
      result = driver(80, 54, 26)
      println("TEST-0...${result}")
      
      result = driver(63, 21, 0)
      println("TEST-1...${result}")
      
      result = driver(1, 56, 1)
      println("TEST-2...${result}")
      
      result = driver(22, 39, 22)
      println("TEST-3...${result}")
      
      result = driver(66, 7, 3)
      println("TEST-4...${result}")
      
      result = driver(61, 67, 61)
      println("TEST-5...${result}")
      
      result = driver(45, 63, 45)
      println("TEST-6...${result}")
      
      result = driver(29, 44, 29)
      println("TEST-7...${result}")
      
      result = driver(95, 65, 30)
      println("TEST-8...${result}")
      
      result = driver(9, 68, 9)
      println("TEST-9...${result}")
      
          
  }
  
  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 ) );
  }