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-10-23 07:23:53 Anubhav Balodhi
All those who are trying it in languages other than mentioned, will surely get a wa :-P
I learnt WhiteSpace for it, but still can't solve it. aaaah strings...

Last edit: 2014-10-23 07:24:27
2014-10-14 20:21:38 Sachin verma
Not a joke seriusly search brainf**k(u know) is actually a language
2014-10-13 13:16:45 Shyamnaik Guguloth
i am unable to submit my problem and thats running perfectly on my computer
2014-10-09 20:10:26 karan
BF _/\_

Last edit: 2014-10-09 20:10:43
2014-10-08 08:46:00 Govinda
in java hardly 10 lines of program
2014-09-27 22:27:05 shakaal
RIP english
2014-09-20 07:33:32 Rishabh Prasad
what the hell why cant i submit the code in other language other than those 3 mentioned.????
2014-08-29 19:38:00 Vikrant Thakre
can u please explain m what to do
2014-08-19 16:21:18 Chitra.N
Can u explain d problem still more briefly with an example ??
2014-08-07 15:23:49 Dior Robert
卡语言永远是最变态的
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.