title: Breaking Number First Part Integral Division Second Power 10
signature: breakingNumberFirstPartIntegralDivisionSecondPower10 :: String -> Integer
  breakingNumberFirstPartIntegralDivisionSecondPower10 n = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Integer -> Integer -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: String -> Integer -> String
  driver n expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME n) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver ("ZCoQhuM") (0) )
  
      printf "TEST-1...%s\n" (driver ("2674377254") (0) )
  
      printf "TEST-2...%s\n" (driver ("11") (1) )
  
      printf "TEST-3...%s\n" (driver ("LbuGlvRyWAPBpo") (0) )
  
      printf "TEST-4...%s\n" (driver ("26382426486138") (0) )
  
      printf "TEST-5...%s\n" (driver ("111010111010") (2) )
  
      printf "TEST-6...%s\n" (driver ("hUInqJXNdbfP") (0) )
  
      printf "TEST-7...%s\n" (driver ("5191") (0) )
  
      printf "TEST-8...%s\n" (driver ("1110101101") (1) )
  
      printf "TEST-9...%s\n" (driver ("2202200") (2) )
  
source_py: def breaking_number_first_part_integral_division_second_power_10(N):
      length = len(N)
      l = int((length / 2))
      count = 0
      for i in range((l + 1)):
          s = N[0:(0 + i)]
          l1 = len(s)
          t = N[i:(l1 + i)]
          try:
              if ((s[0] == '0') or (t[0] == '0')):
                  continue
          except:
              continue
          if (s == t):
              count += 1
      return count
source_cpp: int breaking_number_first_part_integral_division_second_power_10(string N) {
    int len = N . length ( );
    int l = ( len ) / 2;
    int count = 0;
    for ( int i = 1;
    i <= l;
    i ++ ) {
      string s = N . substr ( 0, i );
      int l1 = s . length ( );
      string t = N . substr ( i, l1 );
      if ( s [ 0 ] == '0' || t [ 0 ] == '0' ) continue;
      if ( s . compare ( t ) == 0 ) count ++;
    }
    return count;
  }