title: Number Digits Product Two Numbers
signature: function number_digits_product_two_numbers(a, b)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(a, b, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(a, b), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(86, 39, 4);
      @printf("TEST-0...%s\n",result);
      
      result = driver(81, 87, 4);
      @printf("TEST-1...%s\n",result);
      
      result = driver(48, 84, 4);
      @printf("TEST-2...%s\n",result);
      
      result = driver(64, 80, 4);
      @printf("TEST-3...%s\n",result);
      
      result = driver(56, 20, 4);
      @printf("TEST-4...%s\n",result);
      
      result = driver(5, 70, 3);
      @printf("TEST-5...%s\n",result);
      
      result = driver(25, 13, 3);
      @printf("TEST-6...%s\n",result);
      
      result = driver(94, 83, 4);
      @printf("TEST-7...%s\n",result);
      
      result = driver(5, 55, 3);
      @printf("TEST-8...%s\n",result);
      
      result = driver(46, 46, 4);
      @printf("TEST-9...%s\n",result);
      
  end
  
  main()
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;
  }