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:
.Last edit: 2020-01-18 18:08:17
Question is pretty easy. Though more language options should be given. I wanted to solve this here but ended up solving it on eclipse instead.
my brain is fucked
i'm in depression now,,,;_;
Last edit: 2019-12-22 08:54:16
can i solve this in c
neither naive nor z algorithm is working, kindly
Last edit: 2019-10-18 18:34:06