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:
problem's easy af bt realised tht i gotta do it using brainfuck ri8 after solving it in c++.
what kind of restriction is this??
what is the necessity of the problem if we do not know the language?Last edit: 2019-01-01 06:27:27
very good.that is the new language i found in this day
Hahaha not again BrainFuck
Nice! :) Thanks to this problem I found something new about esoteric programming language. -[--->+<]>-.------------.>+[--->++<]>++.
what is brainf**k?
i dont want to learn any new language now:)