← 返回题目

题库练习 Mike and strings

← 上一题下一题 →

A10908 | $Mike and strings$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

Mike has $n$ strings $s_{1},s_{2},...,s_{n}$ each consisting of lowercase English letters. In one move he can choose a string $s_{i}$ , erase the first character and append it to the end of the string. For example, if he has the string "coolmike", in one move he can transform it into the string "oolmikec". Now Mike asks himself: what is minimal number of moves that he needs to do in order to make all the strings equal?

输入格式

The first line contains integer $n$ ( $1<=n<=50$ ) — the number of strings. This is followed by $n$ lines which contain a string each. The $i$ -th line corresponding to string $s_{i}$ . Lengths of strings are equal. Lengths of each string is positive and don't exceed $50$ .

输出格式

Print the minimal number of moves Mike needs in order to make all the strings equal or print $-1$ if there is no solution.

输入输出样例

输入 #1

4
xzzwo
zwoxz
zzwox
xzzwo

输出 #1

输入 #2

2
molzv
lzvmo

输出 #2

输入 #3

3
kc
kc
kc

输出 #3

输入 #4

3
aa
aa
ab

输出 #4

-1

C++ 编辑器

输入

输出