for _ in range(int(input())):
a = input() b = input() s = set()
if len(b) > len(a):
b, a = a, b
for i in range(len(b)):
for j in range(i+1, len(b)+1):
if b[i:j] in a:
s.add(len(b[i:j]))
print((len(a)-max(s))+(len(b)-max(s)) if len(s) > 0 else len(a)+len(b))#include <bits/stdc++.h>
#define ll long long int
#define PI 3.141592653589793238462643383279502884197
#define endl "\n"
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
int t = 1;
cin>>t;
while (t--) {
string a,b; cin>>a>>b;
if(a==b)
{
cout<<0<<endl;
continue;
}
string found="";
for (int i = 0; i <b.size(); ++i) {
string search_for="";
for (int j = i; j <b.size(); ++j) {
search_for+=b[j];
if(a.find(search_for)!=-1)
{
if(found.size()<=search_for.size())
{
found=search_for;
}
}
}
}
if(found=="")
{
cout<<a.size()+b.size()<<endl;
}
else
{
cout<<a.size()+b.size() -(found.size()*2)<<endl;
}
}
return 0;
}
1051. Height Checker | 695. Max Area of Island |
402. Remove K Digits | 97. Interleaving String |
543. Diameter of Binary Tree | 124. Binary Tree Maximum Path Sum |
1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | 501A - Contest |
160A- Twins | 752. Open the Lock |
1535A - Fair Playoff | 1538F - Interesting Function |
1920. Build Array from Permutation | 494. Target Sum |
797. All Paths From Source to Target | 1547B - Alphabetical Strings |
1550A - Find The Array | 118B - Present from Lena |
27A - Next Test | 785. Is Graph Bipartite |
90. Subsets II | 1560A - Dislike of Threes |
36. Valid Sudoku | 557. Reverse Words in a String III |
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |