title: Count Of Pairs Satisfying The Given Condition
signature: pub fn count_of_pairs_satisfying_the_given_condition(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(
        31, 91, 
        31
      ));
      
      println!("TEST-1...{}", driver(
        72, 85, 
        72
      ));
      
      println!("TEST-2...{}", driver(
        23, 49, 
        23
      ));
      
      println!("TEST-3...{}", driver(
        42, 32, 
        42
      ));
      
      println!("TEST-4...{}", driver(
        13, 7, 
        0
      ));
      
      println!("TEST-5...{}", driver(
        93, 5, 
        0
      ));
      
      println!("TEST-6...{}", driver(
        33, 32, 
        33
      ));
      
      println!("TEST-7...{}", driver(
        94, 76, 
        94
      ));
      
      println!("TEST-8...{}", driver(
        60, 60, 
        60
      ));
      
      println!("TEST-9...{}", driver(
        11, 26, 
        11
      ));
      
  }
source_py: def count_of_pairs_satisfying_the_given_condition(a, b):
      s = str(b)
      i = 0
      while (i < len(s)):
          if (s[i] != '9'):
              break
          i += 1
      result = 0
      if (i == len(s)):
          result = (a * len(s))
      else:
          result = (a * (len(s) - 1))
      return result
source_cpp: int count_of_pairs_satisfying_the_given_condition(int a, int b) {
    string s = to_string ( b );
    int i;
    for ( i = 0;
    i < s . length ( );
    i ++ ) {
      if ( s [ i ] != '9' ) break;
    }
    int result;
    if ( i == s . length ( ) ) result = a * s . length ( );
    else result = a * ( s . length ( ) - 1 );
    return result;
  }