CF798B.Mike and strings

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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
```
5
```
输入#2
```
2
molzv
lzvmo
```
输出#2
```
2
```
输入#3
```
3
kc
kc
kc
```
输出#3
```
0
```
输入#4
```
3
aa
aa
ab
```
输出#4
```
-1
```

说明/提示

In the first sample testcase the optimal scenario is to perform operations in such a way as to transform all strings into "zwoxz".

首页