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
|
yersonsz117:
2021-05-23 05:25:19
I just solve this with Python 3 :v too ez |
|
vanceter231002:
2021-05-09 13:10:45
does it mean we will only get A of 10 bits and B of 5 bits?
|
|
karlo_2107:
2021-03-28 22:04:37
BRAINFUCK hahahah |
|
hello_1234:
2021-03-27 13:44:40
Such a hard problem.
|
|
anoopraj46:
2021-03-26 08:53:16
brainfuck is a programming langauge hahaha |
|
mohsehga:
2021-02-23 18:48:05
I am focussing on java so , I am happy to skip this problem. :D |
|
paciej:
2021-01-13 16:03:00
People complaining about three rare languages probably don't know what they represent
|
|
jesse1996:
2020-11-18 14:59:49
C + +, I miss you. |
|
msabit:
2020-11-11 08:23:36
I Solved it in C.
|
|
quannguyenlhp:
2020-10-17 18:10:41
Seriously, all the comments complaining about not being able to use a normal language like C++ or Python. Don't you get the point of this problem? It would be super easy with C++ or Python, but you need to think in a different way to solve it in brainfck. Also the brainfck language has only 8 commands so you can master it in under 1 min. If you can't solve it then u sucks. Nice puzzle by the way. Last edit: 2020-10-17 18:11:27 |
| Added by: | adrian |
| Date: | 2004-05-01 |
| Time limit: | 1s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | BF ICK WHITESPACE |
RSS