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:
any other language to code
it's easy problem it can done in big O(n) use window sliding technique space complexity O(1)
Are you kidding with us :D
where is cpp ?.brainfuck? cpp17 should added in spoj. too much backdated
wtf is BRAINF**K???? only 3 compiling options?
finally a question in which brainfuck can
I first tried with code for 2 in 3 chars substring and it worked. If idea is ok then I just need to proceed with caution with actual solution.