title: Number Digits Product Two Numbers
signature: pub fn number_digits_product_two_numbers(a: i32, b: 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(a: i32, b: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(a, b), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        86, 39, 
        4
      ));
      
      println!("TEST-1...{}", driver(
        81, 87, 
        4
      ));
      
      println!("TEST-2...{}", driver(
        48, 84, 
        4
      ));
      
      println!("TEST-3...{}", driver(
        64, 80, 
        4
      ));
      
      println!("TEST-4...{}", driver(
        56, 20, 
        4
      ));
      
      println!("TEST-5...{}", driver(
        5, 70, 
        3
      ));
      
      println!("TEST-6...{}", driver(
        25, 13, 
        3
      ));
      
      println!("TEST-7...{}", driver(
        94, 83, 
        4
      ));
      
      println!("TEST-8...{}", driver(
        5, 55, 
        3
      ));
      
      println!("TEST-9...{}", driver(
        46, 46, 
        4
      ));
      
  }
source_py: def number_digits_product_two_numbers(a, b):
      count = 0
      p = abs((a * b))
      if (p == 0):
          return 1
      while (p > 0):
          count = (count + 1)
          p = (p // 10)
      return count
source_cpp: int number_digits_product_two_numbers(int a, int b) {
    int count = 0;
    int p = abs ( a * b );
    if ( p == 0 ) return 1;
    while ( p > 0 ) {
      count ++;
      p = p / 10;
    }
    return count;
  }