Find the Shortest Common Superstring

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)
Total Submission(s): 295 Accepted Submission(s): 37

Problem Description

The shortest common superstring of 2 strings S₁ and S₂ is a string S with the minimum number of characters which contains both S₁ and S₂ as a sequence of consecutive characters. For instance, the shortest common superstring of “alba” and “bacau” is “albacau”.
Given two strings composed of lowercase English characters, find the length of their shortest common superstring.

Input

The first line of input contains an integer number T, representing the number of test cases to follow. Each test case consists of 2 lines. The first of these lines contains the string S₁ and the second line contains the string S₂. Both of these strings contain at least 1 and at most 1.000.000 characters.

Output

For each of the T test cases, in the order given in the input, print one line containing the length of the shortest common superstring.

Sample Input

2
alba
bacau
resita
mures

Sample Output

7
8

Author

Mugurel Ionut Andreica

Statistic | Submit | Clarifications | Back