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 only know c/c++ and java !!oh, what a pity!!
It's a problem for esoteric languages. It's medium difficulty with those but trivial with standards like C++ or pascal. It wouldn't make sense to add more.Last edit: 2012-12-12 20:19:09
Why can´t use another languajes?
Man, it is really really annoying that this bff interpreter sucks.
Is there any garbage in the input lines after string B?
You should organize your input in a quick way to be processed. This tutorial was helpful: http://nieko.net/projects/brainfuck