Submit | All submissions | Best solutions | Back to list |
MSTRING - String problem |
English | Vietnamese |
Substring of some string A is defined as one or more (not necessarily consecutive) elements of the string while maintaining the order.
There are given two strings, string VOKI and string TOKI. Write the program that will calculate the length of any shortest substring of string VOKI such as it is not substring of string TOKI.
Input
In first line of input file there is string VOKI and in second one is string TOKI. The only characters that will occur are lowercase characters of English alphabet (āaā- āzā). String lengths will be less or equal to 1000.
Note: input data will be such so there will always be a solution.
Output
In the first line of file you should print the length of wanted substring.
Sample
Input: banana anbnaanbaan Output: 5(e.g. banna)
Input: babab babba Output: 3(e.g. aab)
Added by: | psetter |
Date: | 2009-02-28 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ERL JS-RHINO NODEJS PERL6 VB.NET |
Resource: | COI 04 |