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
hide comments
my_life_56:
20180406 13:19:31
Last edit: 20180406 13:23:47 

joker70:
20180208 21:24:05
hi 

seema_pawar18:
20180207 13:27:06
Can anyone help me to understand this question.its totally garbage for me??? 

seema_pawar18:
20180207 13:26:19
question is not clear


rv111:
20180107 05:05:39
++++++++[>++++[>++>+++>+++>+<<<<]>+>+>>>+[<]<]>>.>.+++++++..+++.>>.<.<.+++...>>+.>++.


hieutony159357:
20171222 04:54:22
uh...... i dont think this is a problem to solve :) 

ystm:
20171216 05:38:23
I understood that turingcomplete doesn't give any confortable to programming language. 

keshavsharma:
20171204 17:11:27
Not fair. 

skr2209:
20171112 07:09:19
i can't submit 

rashmit:
20171030 12:54:59
same prob

Added by:  adrian 
Date:  20040501 
Time limit:  0.979s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  BF ICK WHITESPACE 