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
tuleaux: 2019-08-06 14:31:02

lol

nidhish1407: 2019-07-05 12:13:03

SKIP THIS !!!
NO LOSS-------->

annms: 2019-06-18 09:27:17

this ones easy guys

anurag_sahu: 2019-06-17 00:32:16

seriously brainf**king.

sourabh_005: 2019-06-02 13:26:04

let's skip this!!

prophet_1337: 2019-06-01 11:30:56

i dont wanna learn new language ;-;

hetp111: 2019-04-26 07:31:28

LoL

atulbrk: 2019-04-10 18:06:55

problem's easy af bt realised tht i gotta do it using brainfuck ri8 after solving it in c++.
F********edit***************K

Last edit: 2019-04-11 02:48:44
unknown_team_1: 2019-03-27 06:29:51

fuck\

harsh1334: 2019-03-03 15:38:04

what kind of restriction is this??


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