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
hddssd: 2018-11-27 16:34:20

very good.that is the new language i found in this day

pranjal035: 2018-11-22 06:19:18

Hahaha not again BrainFuck

solo_2: 2018-11-03 06:58:37

Nice! :) Thanks to this problem I found something new about esoteric programming language. -[--->+<]>-.------------.>+[--->++<]>++.

aunkhtoo: 2018-10-09 20:44:39

what is brainf**k?

deepak1997: 2018-09-19 14:03:55

i dont want to learn any new language now:)

djihane: 2018-08-17 16:56:15

i didn't got it :(

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


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