title: Program To Find Remainder Without Using Modulo Or Operator 2
signature: int programToFindRemainderWithoutUsingModuloOrOperator2(int num, int divisor) {
test_code: #include <algorithm>
  #include <assert.h>
  #include <cstdlib>
  #include <iostream>
  #include <map>
  #include <set>
  #include <string>
  #include <tuple> 
  #include <unordered_map>
  #include <vector>
  #include <math.h>
  #include <cmath>
  #include <bits/stdc++.h>
  #include <numeric>
  #include <functional>
  
  using namespace std;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual == expected;
  }
  
  string driver(int num, int divisor, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(num, divisor), expected)){
              return "PASSED";
          }
          return "FAILED";
      }
      catch (const std::overflow_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::runtime_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::exception& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (...)
      {
          return "UNK_ERROR";
      }
  }
  
  int main() {
      string result = "";
  
      result = driver(70, 13, 5); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(77, 3, 2); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(77, 73, 4); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(88, 54, 34); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(96, 39, 18); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(6, 10, 6); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(79, 95, 79); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(44, 32, 12); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(26, 86, 26); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver(82, 91, 82); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
source_py: def program_to_find_remainder_without_using_modulo_or_operator_2(num, divisor):
      while (num >= divisor):
          num -= divisor
      return num
source_cpp: int program_to_find_remainder_without_using_modulo_or_operator_2(int num, int divisor) {
    while ( num >= divisor ) num -= divisor;
    return num;
  }