title: Program To Find Remainder Without Using Modulo Or Operator
signature: function programToFindRemainderWithoutUsingModuloOrOperator($num, $divisor) {
test_code: <?php
  
  
  // SOLUTION CODE 
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function validateSolution($actual, $expected){
      return serialize($actual) == serialize($expected);
  }
  
  function driver($num, $divisor, $expected){
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME($num, $divisor), $expected)){
          return "PASSED";
        }
        return "FAILED";
      }
      catch (Exception $exception_obj) {
        return get_class($exception_obj);
      }
  }
  
  function main(){
      printf("TEST-0...%s\n",driver(
        80, 54, 
        26));
      
      printf("TEST-1...%s\n",driver(
        63, 21, 
        0));
      
      printf("TEST-2...%s\n",driver(
        1, 56, 
        1));
      
      printf("TEST-3...%s\n",driver(
        22, 39, 
        22));
      
      printf("TEST-4...%s\n",driver(
        66, 7, 
        3));
      
      printf("TEST-5...%s\n",driver(
        61, 67, 
        61));
      
      printf("TEST-6...%s\n",driver(
        45, 63, 
        45));
      
      printf("TEST-7...%s\n",driver(
        29, 44, 
        29));
      
      printf("TEST-8...%s\n",driver(
        95, 65, 
        30));
      
      printf("TEST-9...%s\n",driver(
        9, 68, 
        9));
      
  }
  
  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 ) );
  }