title: Program To Find Remainder Without Using Modulo Or Operator
signature: programToFindRemainderWithoutUsingModuloOrOperator(num, divisor) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(num, divisor, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(num, divisor), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          80, 54, 
          26)
      }");
  
      print("TEST-1...${driver(
          63, 21, 
          0)
      }");
  
      print("TEST-2...${driver(
          1, 56, 
          1)
      }");
  
      print("TEST-3...${driver(
          22, 39, 
          22)
      }");
  
      print("TEST-4...${driver(
          66, 7, 
          3)
      }");
  
      print("TEST-5...${driver(
          61, 67, 
          61)
      }");
  
      print("TEST-6...${driver(
          45, 63, 
          45)
      }");
  
      print("TEST-7...${driver(
          29, 44, 
          29)
      }");
  
      print("TEST-8...${driver(
          95, 65, 
          30)
      }");
  
      print("TEST-9...${driver(
          9, 68, 
          9)
      }");
  
      return 0;
  }
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 ) );
  }