title: Breaking Number First Part Integral Division Second Power 10
signature: fun breakingNumberFirstPartIntegralDivisionSecondPower10(n: String): 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(n: String, expected:Int):String {
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)) {
                return "PASSED"
        }
        return "FAILED"
      } catch (e: Exception){
        return e::class.simpleName as String
      }
  
  }
  
  fun main() {
      var result: String = ""
      result = driver("ZCoQhuM", 0)
      println("TEST-0...${result}")
      
      result = driver("2674377254", 0)
      println("TEST-1...${result}")
      
      result = driver("11", 1)
      println("TEST-2...${result}")
      
      result = driver("LbuGlvRyWAPBpo", 0)
      println("TEST-3...${result}")
      
      result = driver("26382426486138", 0)
      println("TEST-4...${result}")
      
      result = driver("111010111010", 2)
      println("TEST-5...${result}")
      
      result = driver("hUInqJXNdbfP", 0)
      println("TEST-6...${result}")
      
      result = driver("5191", 0)
      println("TEST-7...${result}")
      
      result = driver("1110101101", 1)
      println("TEST-8...${result}")
      
      result = driver("2202200", 2)
      println("TEST-9...${result}")
      
          
  }
  
  main()
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;
  }