Nộp bài | Các bài nộp | Làm tốt nhất | Về danh sách bài |

## 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

Được gửi lên bởi: | adrian |

Ngày: | 2004-05-01 |

Thời gian chạy: | 0.979s |

Giới hạn mã nguồn: | 50000B |

Memory limit: | 1536MB |

Cluster: | Cube (Intel G860) |

Ngôn ngữ cho phép: |