题目描述
The sequence 1, 1010, 2012, 10021 may not look like an arithmetic sequence, but it is one in base 3. Likewise, the sequence 11, 33, 55 is clearly an arithmetic sequence in base 10, but it is also one in base 6. For this problem, you will be given a sequence of numbers and you must write an Arithmetic Con rmation Machine to determine the smallest base under which the numbers form an arithmetic sequence.
输入
Input will consist of multiple problem instances. The rst line will contain a single integer 2 <= n <= 5 indicating the number of values in the sequence. The next line will contain the n numbers in strictly increasing order, separated by a single blank. A value of n = 0 will terminate the input. All numbers will be positive and made up of the digits 0-9 exclusively, and no number will have more than 5 digits.
输出
Output for each instance should consist of one line of either the form Minimum base = x.
where x is the the smallest base <= 10 which results in an arithmetic sequence, or you should output No base <= 10 can be found.
4
1 1010 2012 10021
3
11 33 55
4
11 33 55 77
5
10 160 340 520 1000
5
10 160 340 520 10000
0
Minimum base = 3.
Minimum base = 6.
Minimum base = 8.
Minimum base = 7.
No base <= 10 can be found.