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
my_life_56: 2018-04-06 13:19:31

Last edit: 2018-04-06 13:23:47
joker70: 2018-02-08 21:24:05

hi

seema_pawar18: 2018-02-07 13:27:06

Can anyone help me to understand this question.its totally garbage for me???

seema_pawar18: 2018-02-07 13:26:19

question is not clear

rv111: 2018-01-07 05:05:39

++++++++[>++++[>++>+++>+++>+<<<<-]>+>+>->>+[<]<-]>>.>---.+++++++..+++.>>.<-.<.+++.------.--------.>>+.>++.
" Hello World! " program in brainfuck ,, who is going to solve this que. after seeing this

hieutony159357: 2017-12-22 04:54:22

uh...... i dont think this is a problem to solve :)

ystm: 2017-12-16 05:38:23

I understood that turing-complete doesn't give any confortable to programming language.

keshavsharma: 2017-12-04 17:11:27

Not fair.

skr2209: 2017-11-12 07:09:19

i can't submit

rashmit: 2017-10-30 12:54:59

same prob


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