title: Breaking Number First Part Integral Division Second Power 10
signature: breakingNumberFirstPartIntegralDivisionSecondPower10(n) {
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(n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          "ZCoQhuM", 
          0)
      }");
  
      print("TEST-1...${driver(
          "2674377254", 
          0)
      }");
  
      print("TEST-2...${driver(
          "11", 
          1)
      }");
  
      print("TEST-3...${driver(
          "LbuGlvRyWAPBpo", 
          0)
      }");
  
      print("TEST-4...${driver(
          "26382426486138", 
          0)
      }");
  
      print("TEST-5...${driver(
          "111010111010", 
          2)
      }");
  
      print("TEST-6...${driver(
          "hUInqJXNdbfP", 
          0)
      }");
  
      print("TEST-7...${driver(
          "5191", 
          0)
      }");
  
      print("TEST-8...${driver(
          "1110101101", 
          1)
      }");
  
      print("TEST-9...${driver(
          "2202200", 
          2)
      }");
  
      return 0;
  }
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;
  }