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
|
hieutony159357:
2017-12-22 04:54:22
uh...... i dont think this is a problem to solve :) |
|
ystm:
2017-12-16 05:38:23
I understood that turing-complete doesn't give any confortable to programming language. |
|
keshavsharma:
2017-12-04 17:11:27
Not fair. |
|
skr2209:
2017-11-12 07:09:19
i can't submit |
|
rashmit:
2017-10-30 12:54:59
same prob
|
|
changlangtu97:
2017-10-15 14:25:45
I can't submit my solution. I can't choose C or C++ language!
|
|
beginner_0:
2017-10-10 07:11:14
LOL..... Not in mood to learn new programing . |
|
tanay_kumar:
2017-09-11 19:42:21
hahaha |
|
user314159:
2017-07-08 08:58:18
Nice problem. Forces you to think unconventionally. 986 commands |
|
hasan_nsu:
2017-06-04 23:00:01
can't submit my solution. its show only Brainf***. Whats the problem ? |
| 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