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
|
teluguboy:
2020-01-22 04:52:24
python:
|
|
ankit_thakur98:
2020-01-15 16:40:34
Question is pretty easy. Though more language options should be given. I wanted to solve this here but ended up solving it on eclipse instead. |
|
tainguyen2003:
2020-01-10 15:42:26
i'm despressed |
|
ngosangns:
2020-01-09 13:13:07
my brain is fucked |
|
robinfood:
2020-01-02 18:23:41
i'm in depression now,,,;_;
|
|
dileep_32:
2019-10-22 19:32:30
can i solve this in c |
|
shivam216:
2019-10-20 17:01:27
neither naive nor z algorithm is working, kindly
|
|
marin3323:
2019-10-18 18:33:57
Last edit: 2019-10-18 18:34:06 |
|
princebilly:
2019-09-30 10:26:08
Why man -_- why. Is there any practical use of these languages? |
|
perl_add_add:
2019-09-27 06:53:52
I wish I can submit in c++ language but the answer is no. |
| 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