A. Sequence with Digits(思维)

A. Sequence with Digits

公式：$a_{n+1}=a_n+minDigit(a_n)\cdot maxDigit(a_n)$
含义：$minDigit(a_n)，a_n$The minimum value in each decimal position of. $maxDigit\left(a_n\right)，a_n$The maximum value in each decimal position of.
For example: min Digit (an) = 0 for the number 83901 $minDigit\left(a_n\right)=0，maxDigit(a_n)=9$。

Meaning of the title: give $a_1,K$ is calculated according to the formula$a_k$

Idea: When $minDigit\left(a_n\right)==At\; 0$ , the entire number will no longer change. You can directly output the answer.

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll Max(ll x) {
    
    
	ll mx = x%10;
	x /= 10;
	while(x) mx = max(x%10, mx), x /= 10;
	return mx;
}
ll Min(ll x) {
    
    
	ll mi = x%10;
	x /= 10;
	while(x) mi = min(x%10, mi), x /= 10;
	return mi;
}

int main() {
    
    
	int t;
	scanf("%d", &t);
	while(t--) {
    
    
		ll n, m, x, y;
		scanf("%lld%lld", &n, &m);
		for(int i=1; i<m; i++) {
    
    
			x = Max(n), y = Min(n);
			if(y == 0) break;
			n = n + x*y;
		}
		printf("%lld\n", n);
	}
	return 0;
}