title: Count Of Pairs Satisfying The Given Condition
signature: countOfPairsSatisfyingTheGivenCondition(a, b) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(a, b, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(a, b), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          31, 91, 
          31)
      }");
  
      print("TEST-1...${driver(
          72, 85, 
          72)
      }");
  
      print("TEST-2...${driver(
          23, 49, 
          23)
      }");
  
      print("TEST-3...${driver(
          42, 32, 
          42)
      }");
  
      print("TEST-4...${driver(
          13, 7, 
          0)
      }");
  
      print("TEST-5...${driver(
          93, 5, 
          0)
      }");
  
      print("TEST-6...${driver(
          33, 32, 
          33)
      }");
  
      print("TEST-7...${driver(
          94, 76, 
          94)
      }");
  
      print("TEST-8...${driver(
          60, 60, 
          60)
      }");
  
      print("TEST-9...${driver(
          11, 26, 
          11)
      }");
  
      return 0;
  }
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;
  }