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