SBSTR1 - Substring Check (Bug Funny)
Given two binary strings, A (of length 10) and B (of length 5), output 1 if B is a substring of A and 0 otherwise.
Please note, that the solution may only be submitted in the following languages: Brainf**k, Whitespace and Intercal.
24 lines consisting of pairs of binary strings A and B separated by a single space.
The logical value of: 'B is a substring of A'.
First two lines of input:
First two lines of output:
I am focussing on java so , I am happy to skip this problem. :D
People complaining about three rare languages probably don't know what they represent
C + +, I miss you.
I Solved it in C.
Seriously, all the comments complaining about not being able to use a normal language like C++ or Python. Don't you get the point of this problem? It would be super easy with C++ or Python, but you need to think in a different way to solve it in brainfck. Also the brainfck language has only 8 commands so you can master it in under 1 min. If you can't solve it then u sucks. Nice puzzle by the way.Last edit: 2020-10-17 18:11:27
why on earth does the setter wants the submission in only 3 fuckin rare languages...he was probably high xD
well what the fuck is wrong with the setter. Using these three language. Man before this question, I didn't even heard about these languages and the setter wants me to solve in this language. Fuck not gonna happen!!!!!!!!!
Finally! somewhere I can use brainfuck :D
wtf ? brainfuck? never heard of it.
For anyone that will dare to try this problem after solving it I have to give 3 major tips that will make your life 10 times easier with this: