close

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
Image balajirai: 2026-04-18 22:00:42

are u comedy me

Image yalguun_m: 2026-02-23 06:39:20

Never thought i'd see spoj curse before gta6 XD

Image csesbetter: 2026-02-22 09:17:03

what are these languages btw , huh??

Image dzwng: 2026-01-27 22:23:45

Please note, for INTERCAL, you may need to submit your working solution several times before it gets accepted. Ideone sometimes does not compile for not-INTERCAL-related reasons + INTERCAL's compiler sometimes randomly errors due to "E774 RANDOM COMPILER BUG"

Image jhansi6prsnl: 2024-11-17 09:27:29

brainfuck.....wtf?

Image leoweyles: 2024-04-09 21:06:12

cursed af

Image venom_79: 2024-01-28 14:18:45

DELETE THIS PROBLEMMMMMMM

Image prashanth_kpy: 2023-09-29 16:07:08

any other language to code

Image vicky_yadav: 2023-02-15 18:49:48

it's easy problem it can done in big O(n) use window sliding technique space complexity O(1)
there is several more approach but this is best of all of them . happy coding <champ :>?

Image mdmarufsarker: 2023-02-12 00:17:44

Are you kidding with us :D


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