{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"给定N个字符串,某个字符串转为另一个字符串的花费为他们每一位不相同的字符数。\n求最小花费Q。"}},{"title":"Input","value":{"format":"HTML","content":"\n 多组输入,以0结束。\n保证N不超过2000。"}},{"title":"Output","value":{"format":"HTML","content":"\n 每组输出\"The highest possible quality is 1/Q.\"。"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e4\naaaaaaa\nbaaaaaa\nabaaaaa\naabaaaa\n0\n\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003eThe highest possible quality is 1/3.\n\u003c/pre\u003e"}}]}