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:
uh...... i dont think this is a problem to solve :)
I understood that turing-complete doesn't give any confortable to programming language.
i can't submit
I can't submit my solution. I can't choose C or C++ language!
LOL..... Not in mood to learn new programing .
Last edit: 2017-10-05 15:42:11
Nice problem. Forces you to think unconventionally. 986 commands