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:
Why such a language restriction ? That is quite discouraging. I realized this after solving the problem when I expanded the language drop down.
how could such a problem TLE!
Brainfuck isn't that bad. Actually, I really enjoyed it. :)
Anubhav Balodhi :
All those who are trying it in languages other than mentioned, will surely get a wa :-P
Not a joke seriusly search brainf**k(u know) is actually a language
i am unable to submit my problem and thats running perfectly on my computer
BF _/\_Last edit: 2014-10-09 20:10:43
in java hardly 10 lines of program
what the hell why cant i submit the code in other language other than those 3 mentioned.????