title: Breaking Number First Part Integral Division Second Power 10
signature: int breakingNumberFirstPartIntegralDivisionSecondPower10(string n) {
test_code: #include <algorithm>
  #include <assert.h>
  #include <cstdlib>
  #include <iostream>
  #include <map>
  #include <set>
  #include <string>
  #include <tuple> 
  #include <unordered_map>
  #include <vector>
  #include <math.h>
  #include <cmath>
  #include <bits/stdc++.h>
  #include <numeric>
  #include <functional>
  
  using namespace std;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual == expected;
  }
  
  string driver(string n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }
      catch (const std::overflow_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::runtime_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::exception& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (...)
      {
          return "UNK_ERROR";
      }
  }
  
  int main() {
      string result = "";
  
      result = driver("ZCoQhuM", 0); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver("2674377254", 0); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver("11", 1); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver("LbuGlvRyWAPBpo", 0); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver("26382426486138", 0); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver("111010111010", 2); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver("hUInqJXNdbfP", 0); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver("5191", 0); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver("1110101101", 1); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver("2202200", 2); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      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;
  }