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
ketphan02: 2018-07-20 16:25:27

Please note, that the solution may only be submitted in the following languages: Brainf**k, Whitespace and Intercal.
It will be easier without this.

atiq8501: 2018-07-18 20:52:59

Brainfuck

rogu_auto: 2018-07-13 16:04:14

what is brainf**k??? :D

devin2018_ok: 2018-07-10 16:27:01

LOL

krishnam: 2018-06-01 05:00:10

how can i submit in java ?

tranquanghai: 2018-05-02 15:38:28

Last edit: 2018-05-20 11:13:04
my_life_56: 2018-04-06 13:19:31

Last edit: 2018-04-06 13:23:47
joker70: 2018-02-08 21:24:05

hi

seema_pawar18: 2018-02-07 13:27:06

Can anyone help me to understand this question.its totally garbage for me???

seema_pawar18: 2018-02-07 13:26:19

question is not clear


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