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
|
perl_add_add:
2019-09-27 06:53:52
I wish I can submit in c++ language but the answer is no. |
|
laxus2020:
2019-08-20 19:37:12
hhhh i have a runtime error , i used the function find(). |
|
lakerbymbaa:
2019-08-19 02:17:12
good boy |
|
umnikos:
2019-08-08 20:19:09
"INTERCAL is deliberately difficult. It is nearly impossible to read or write. Accomplishing the most trivial task is exceptionally time-consuming and headache inducing."
|
|
tuleaux:
2019-08-06 14:31:02
lol |
|
nidhish1407:
2019-07-05 12:13:03
SKIP THIS !!!
|
|
annms:
2019-06-18 09:27:17
this ones easy guys |
|
anurag_sahu:
2019-06-17 00:32:16
seriously brainf**king. |
|
sourabh_005:
2019-06-02 13:26:04
let's skip this!! |
|
prophet_1337:
2019-06-01 11:30:56
i dont wanna learn new language ;-;
|
| 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