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
tanay_kumar: 2017-09-11 19:42:21


jonathanzong: 2017-08-25 00:35:36

wonder how many commands in BrainF**k with KMP algorithm

user314159: 2017-07-08 08:58:18

Nice problem. Forces you to think unconventionally. 986 commands

hasan_nsu: 2017-06-04 23:00:01

can't submit my solution. its show only Brainf***. Whats the problem ?

nawaz_ra: 2017-05-18 20:12:06

Has anyone tried this in BASH ?

hoangnt2601: 2017-05-10 12:08:11

I can't submit my solution. I don't know BrainF**k :(

tushar091: 2017-05-01 09:03:33


pheonix_101: 2017-04-11 16:48:06

why not in other languages like c or c++

bnzhaxx: 2017-03-18 22:05:00

I got a TLE with java, but i tested it with the example input and it was correct!
What is happening?
(I submitted as BrainFuck)

cake_is_a_lie: 2017-02-06 23:02:48

1) Some people need to learn to read the problem statement before submitting the solution (the accepted languages are in bold); and brainfuck WILL compile Java or C++ or pretty much any syntax just fine; the only reason it might fail to compile is missmatched brackets.
2) Computer science is more about abstract thinking than about knowing Java. Using esoteric languages is sometimes a good exercise for that.
3) Might be useful to know bff has 32 bit ints and their version as of now (1.0.5) doesn't optimize [-] and [+]; the most recent version on SF (1.0.6) optimizes [-] and [+] so they wouldn't risk timing you out.

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