Not able to get the correct approach

#1

not able to get the correct approach

#2

@shubhamkumarsingh,
Approach:

  1. check for all sub-strings of the given string of digits, starting from the all strings of length 1 and then gradually checking for the strings of increasing size:

1.1. check if the sub-string is CB number: for this, create a function
1.1.1. if sub-string is 1 or 0 return false.
1.1.2. if sub-string is any of the {2,3,5,7,11,13,17,19,23,29}, then return true.
1.1.3. if sub-string is divisible by any of the {2,3,5,7,11,13,17,19,23,29}, then return false.
1.1.4. return false

1.2. now if it is a substring:
1.2.1. call a function that marks the index as visited for indexes which are part of that CB number.

1.3. increment the count for CB number.

  1. Print the count
#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.

#4

It is showing run error in 2 cases and wrong answer in one case

#5

not able to get this thing correctly here is my code https://ide.codingblocks.com/s/305731

#6

not able to get this thing correctly here is my code https://ide.codingblocks.com/s/305731

#7

@shubhamkumarsingh,

Use a visited array to mark indexes as visited which are a part of CB number. The size of the array will be length of strings. And a CB number will be possible only if at all indexes the value is 0 in the visited array.

#8

@shubhamkumarsingh,
Did you try this approach?

#9

Yes I tried it, thank you .