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.

Input

24 lines consisting of pairs of binary strings A and B separated by a single space.

Output

The logical value of: 'B is a substring of A'.

Example

First two lines of input:

1010110010 10110
1110111011 10011

First two lines of output:
1
0


hide comments
yogomate: 2022-08-15 13:03:23

finally a question in which brainfuck can
be used

isuckatcpp: 2022-05-28 17:25:16

kekw

zinfx_09: 2022-02-23 02:56:40

wtfff

jms_maksio: 2022-02-18 21:33:19

I first tried with code for 2 in 3 chars substring and it worked. If idea is ok then I just need to proceed with caution with actual solution.

safiuddin: 2022-01-19 09:18:47

where to write the code and what the heck is BRAINF**K.

orno: 2021-11-27 23:48:39

Finally !
The hardest thing to me was managing the loops

freaking_omen: 2021-08-04 20:09:59

Are you kidding me Brainfuck!!!! I just checked the syntax of bf , OMG wtf it is!!

guneet_1995: 2021-08-02 08:44:00

Brainfuck OMG

shadowfax1: 2021-08-01 19:13:32

one line solution for this prob but hmm....

nintachi55: 2021-07-23 21:32:55

are you... sure there are substrings in bf ? or even "strings"
all i know is that there are pointers are they strings that store one character ?


Added by:adrian
Date:2004-05-01
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:BF ICK WHITESPACE