Submit | All submissions | Best solutions | Back to list |
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
|
||||||||||||||
2019-04-26 07:31:28
LoL |
||||||||||||||
2019-04-10 18:06:55
problem's easy af bt realised tht i gotta do it using brainfuck ri8 after solving it in c++. F********edit***************K Last edit: 2019-04-11 02:48:44 |
||||||||||||||
2019-03-27 06:29:51
fuck\ |
||||||||||||||
2019-03-03 15:38:04
what kind of restriction is this?? |
||||||||||||||
2018-12-31 19:15:00
what is the necessity of the problem if we do not know the language? Last edit: 2019-01-01 06:27:27 |
||||||||||||||
2018-11-27 16:34:20
very good.that is the new language i found in this day |
||||||||||||||
2018-11-22 06:19:18
Hahaha not again BrainFuck |
||||||||||||||
2018-11-03 06:58:37
Nice! :) Thanks to this problem I found something new about esoteric programming language. -[--->+<]>-.------------.>+[--->++<]>++. |
||||||||||||||
2018-10-09 20:44:39
what is brainf**k? |
||||||||||||||
2018-09-19 14:03:55
i dont want to learn any new language now:) |