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:
wonder how many commands in BrainF**k with KMP algorithm
Nice problem. Forces you to think unconventionally. 986 commands
can't submit my solution. its show only Brainf***. Whats the problem ?
Has anyone tried this in BASH ?
I can't submit my solution. I don't know BrainF**k :(
why not in other languages like c or c++
I got a TLE with java, but i tested it with the example input and it was correct!
1) Some people need to learn to read the problem statement before submitting the solution (the accepted languages are in bold); and brainfuck WILL compile Java or C++ or pretty much any syntax just fine; the only reason it might fail to compile is missmatched brackets.