SBSTR1 - Substring Check (Bug Funny)

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


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

hide comments
2014-07-21 10:18:44 abdullah malikyar
guys guys the language specification is just a joke LOL the author is just trying to be funny

Last edit: 2014-07-21 10:20:28
2014-07-02 18:13:36 pengyi
Is there something wrong with the author? Why can't I use other languages???
2014-07-02 14:13:25 Prince Bansal
This is language specific question.
And I do not even heard about these languages.
2014-07-01 17:07:41 habibullah bipu
i dislike those problem that are supports only one languages.
2014-07-01 13:30:03 hzf
wtf??
2014-05-26 18:28:30 Sudheer Telugu
please..!! done it in java.. :D :D
2014-05-24 17:02:42 Sidharth Yatish
one doubt.. should we give 24 inputs?


Last edit: 2014-05-24 17:03:54
2014-05-21 21:22:37 Neeraj Jain
Hate Language specific problem
2014-05-18 09:06:14 prakash
i can done this problem with c
2014-04-13 02:47:33 mahmoud shawara
i did it with c++
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.