title: Program To Find Remainder Without Using Modulo Or Operator 2
signature: pub fn program_to_find_remainder_without_using_modulo_or_operator_2(num: i32, divisor: i32) -> i32 {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: i32, expected: i32)->bool{
  return actual==expected
  }
  pub fn driver(num: i32, divisor: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(num, divisor), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        70, 13, 
        5
      ));
      
      println!("TEST-1...{}", driver(
        77, 3, 
        2
      ));
      
      println!("TEST-2...{}", driver(
        77, 73, 
        4
      ));
      
      println!("TEST-3...{}", driver(
        88, 54, 
        34
      ));
      
      println!("TEST-4...{}", driver(
        96, 39, 
        18
      ));
      
      println!("TEST-5...{}", driver(
        6, 10, 
        6
      ));
      
      println!("TEST-6...{}", driver(
        79, 95, 
        79
      ));
      
      println!("TEST-7...{}", driver(
        44, 32, 
        12
      ));
      
      println!("TEST-8...{}", driver(
        26, 86, 
        26
      ));
      
      println!("TEST-9...{}", driver(
        82, 91, 
        82
      ));
      
  }
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;
  }