For this Question: You are given a positive integer A. You have to apply the following operation on it N times:
<ul><li>Let the maximum and minimum digits in the decimal representation of A be <i>mx</i> and <i>mn</i> respectively. </li><li>Add mx*mn to A, i. e, convert A to A + mx*mn. </li></ul>Find the value of A after applying this operation N times.First and the only line of the input contains two integers A and N.

Constraints:
1 <= A <= 10<sup>18</sup>
1 <= N <= 10<sup>16</sup>Print the value of A after applying the above operation N times.Sample Input
8 3

Sample Output
134

Explaination:
During the first operation, mx = 8, mn = 8.
A = 8 + (8*8) = 8 + 64 = 72
During the second operation, mx = 7, mn = 2
A = 72 + (7*2) = 72 + 14 = 86
During the final operation, mx = 8, mn = 6
A = 86 + (8*6) = 86 + 48 = 134, I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
 
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);
#define int long long
#define pb push_back
#define ff first
#define ss second
#define endl '\n'
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using T = pair<int, int>;
typedef long double ld;
 
const int mod = 1e9 + 7;
const int INF = 2e9;

int chk(int n){
    int mi = 100, ma = -1;
    while(n){
        mi = min(mi, n%10);
        ma = max(ma, n%10);
        n /= 10;
    }
    return ma*mi;
}
 
void solve(){
    int x, y, f=0;
    cin >> x >> y;
    while(y--){
        int a = chk(x);
        x += a;
        if(a == 0){
            break;
        }
    }
    cout << x;
}
 
signed main(){
    fast
    int t = 1;
    // cin >> t;
    for(int i = 1; i <= t; i++){
        solve();
        if(i != t) cout << endl;
    }
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?