poj3696 The Luckiest number 数论

poj3696 The Luckiest number 数论    10^x - 1

2012年08月30日 19:09:14 qiqijianglu 阅读数：2068

The Luckiest number

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 3536		Accepted: 917

Description

Chinese people think of '8' as the lucky digit. Bob also likes digit '8'. Moreover, Bob has his own lucky numberL. Now he wants to construct his luckiest number which is the minimum among all positive integers that are a multiple of L and consist of only digit '8'.

Input

The input consists of multiple test cases. Each test case contains exactly one line containing L(1 ≤ L ≤ 2,000,000,000).

The last test case is followed by a line containing a zero.

Output

For each test case, print a line containing the test case number( beginning with 1) followed by a integer which is the length of Bob's luckiest number. If Bob can't construct his luckiest number, print a zero.

Sample Input

8
11
16
0

Sample Output

Case 1: 1
Case 2: 2
Case 3: 0

Source

2008 Asia Hefei Regional Contest Online by USTC

 

步骤：

1、化简

2、可以得到 a^x三1 

3.性质可知 x一定是 phi(p)的约数

4.枚举就能得到答案