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
sadinenibalu: 2020-03-21 07:22:15

Why c is not available to do this?

Jorge Rocha Gualtieri: 2020-03-17 17:38:46

finally got it accepted

Last edit: 2020-03-17 21:01:19
k3rnel: 2020-03-07 18:02:34

why can't i solve this in c.

smallpillow: 2020-03-06 06:48:08

i am depressed...
pls can i solve this in c++?

shaigloria: 2020-03-04 08:25:11

is the length of stringA and stringB static?

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

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