SBSTR1 - Substring Check (Bug Funny)

no tags 

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:

1010110010 10110
1110111011 10011

First two lines of output:

hide comments
teluguboy: 2020-01-22 04:52:24

if first one in second one:
return true

subbu988: 2020-01-18 18:07:32


Last edit: 2020-01-18 18:08:17
ankit_thakur98: 2020-01-15 16:40:34

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.

tainguyen2003: 2020-01-10 15:42:26

i'm despressed

ngosangns: 2020-01-09 13:13:07

my brain is fucked

robinfood: 2020-01-02 18:23:41

i'm in depression now,,,;_;

samio: 2019-12-22 08:53:29

Last edit: 2019-12-22 08:54:16
dileep_32: 2019-10-22 19:32:30

can i solve this in c

shivam216: 2019-10-20 17:01:27

neither naive nor z algorithm is working, kindly
help me.

marin3323: 2019-10-18 18:33:57

Last edit: 2019-10-18 18:34:06

Added by:adrian
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)