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
2020-05-05 21:30:33
The whole point of this question is to make the implementation really difficult. It's not supposed to be solved in C lmfao
2020-05-04 19:23:56
plz make it available for c
2020-05-03 15:35:53
oh bhaai mujhe marooo
2020-03-28 16:34:19
My problem is solved I really thank you
2020-03-28 16:16:56
if Node.js available I can give a solution of only one line.
2020-03-21 07:22:15
Why c is not available to do this?
2020-03-17 17:38:46 Jorge Rocha Gualtieri
finally got it accepted

Last edit: 2020-03-17 21:01:19
2020-03-07 18:02:34
why can't i solve this in c.
2020-03-06 06:48:08
i am depressed...
pls can i solve this in c++?
2020-03-04 08:25:11
is the length of stringA and stringB static?
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.