title: Program To Find Remainder Without Using Modulo Or Operator 1
signature: fun programToFindRemainderWithoutUsingModuloOrOperator1(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(34, 55, 34)
      println("TEST-0...${result}")
      
      result = driver(63, 22, 19)
      println("TEST-1...${result}")
      
      result = driver(15, 26, 15)
      println("TEST-2...${result}")
      
      result = driver(56, 58, 56)
      println("TEST-3...${result}")
      
      result = driver(63, 94, 63)
      println("TEST-4...${result}")
      
      result = driver(28, 45, 28)
      println("TEST-5...${result}")
      
      result = driver(54, 97, 54)
      println("TEST-6...${result}")
      
      result = driver(2, 58, 2)
      println("TEST-7...${result}")
      
      result = driver(94, 91, 3)
      println("TEST-8...${result}")
      
      result = driver(82, 40, 2)
      println("TEST-9...${result}")
      
          
  }
  
  main()
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 );
  }