題解/算法 {202. 最幸运的数字}

Link

Solution

Suppose the problem is solvable and let the answer be $x$, then $888...\%L=0$

$\mathrm{888...}\equiv 0(\%L)$

$8\ast \frac{10^x-1}{9}=k\ast L$ (where $k$ is unknown, it is a certain integer $k>0$ due to $x>0$)

$10^x-1=\frac{k\ast 9\ast L}{8}$ (Note that, the right hand fraction must be a integer $>0$ due to $k>0$, and $\frac{k\ast 9\ast L}{8}\ne k\ast \frac{9\ast L}{8}$ according to 整数分式的分解)
. Cuz $k$ is unknown, we should take it out of the formula; Let $g=GCD(9\ast L,8)$ and $8=g\ast t$, then $\frac{k\ast 9\ast L}{8}=\frac{k}{t}\ast \frac{9\ast L}{g}$ where the right-hand two fraction must be integer; now let $k_1=\frac{k}{t}$ be the unknown.

$10^x-1=k_1\ast \frac{9\ast L}{g}$ ($k_1$ is a certain integer)

$10^x-1\equiv 0(\%\frac{9\ast L}{g})$ (According to 将等式转换为同余式)

Finally, $10^x\equiv 1(\%\frac{9\ast L}{g})$

For generality, $a^x\equiv 1(\%M)$
+ Solvable if-and-only-if $a,M$ are co-prime;
+ According to 最小正幂为欧拉函数的约数, iterating all divisors of $x|\varphi (M)$, and using Binary-Exponentiation to test whether $a^x\%M$ equals $1$;

Code

L;
M = 9 * L / GCD(9 * L, 8);
if( GCD( M, 10) != 1){
	return "Unsolvable";
}
Phi = $( euler_function of `M`);
for( `x` : all divisors of `Phi` increasingly){
	if( $10 ^ x (% M)$ == 1){
		return "answer is x";
	}
}