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:
@andy, a bunch of joy that looks like nonsense when you are done.
What in the hell is Brainfuck language?
Rezaul H Sagar:
I've learnt a new language name- "Brainfuck" :p
coded in java and they Brain*fucked it :P
Very Easy to solve in Java using contains() function in strings
So is the challenge supposed to be that you have to use a stupid language?
OOH NOO! I cannot send my beautiful one line xD
Write the code in c/c++ , then realize its not allowed for this problem :P
actully...with these types of problems(not allowing all languages) you cant test coding skills...