title: Count Of Pairs Satisfying The Given Condition
signature: fun countOfPairsSatisfyingTheGivenCondition(a: Int, b: Int): Int {
test_code: package main
  
  import kotlin.text.*
  import kotlin.math.*
  
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  fun validateSolution(actual:Int, expected:Int):Boolean{
    return actual.equals(expected)
  }
  fun driver(a: Int, b: Int, expected:Int):String {
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME(a, b), expected)) {
                return "PASSED"
        }
        return "FAILED"
      } catch (e: Exception){
        return e::class.simpleName as String
      }
  
  }
  
  fun main() {
      var result: String = ""
      result = driver(31, 91, 31)
      println("TEST-0...${result}")
      
      result = driver(72, 85, 72)
      println("TEST-1...${result}")
      
      result = driver(23, 49, 23)
      println("TEST-2...${result}")
      
      result = driver(42, 32, 42)
      println("TEST-3...${result}")
      
      result = driver(13, 7, 0)
      println("TEST-4...${result}")
      
      result = driver(93, 5, 0)
      println("TEST-5...${result}")
      
      result = driver(33, 32, 33)
      println("TEST-6...${result}")
      
      result = driver(94, 76, 94)
      println("TEST-7...${result}")
      
      result = driver(60, 60, 60)
      println("TEST-8...${result}")
      
      result = driver(11, 26, 11)
      println("TEST-9...${result}")
      
          
  }
  
  main()
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;
  }