# Nth term of a sequence formed by sum of current term with product of its largest and smallest digit

Given two numbers N and K, where K represents the starting term of the sequence. The task is to find the Nth term of a sequence formed by sum of current term with product of largest and smallest digit of current term, i.e.,

AN+1 = AN + max(digits of AN) * min(digits of AN)

Examples:

Input: K = 1, N = 5
Output: 50
Explanation:
A1 = 1
A2 = A1 + minDigit( A1 ) * maxDigit( A1 ) = 1 + min(1) * max(1) = 1 + 1*1 = 2
A3 = A2 + minDigit( A2 ) * maxDigit( A2 ) = 2 + min(2) * max(2) = 2 + 2*2 = 6
A4 = A3 + minDigit( A3 ) * maxDigit( A3 ) = 6 + min(6) * max(6) = 6 + 6*6 = 42
A5 = A4 + minDigit( A4 ) * maxDigit( A4 ) = 42 + min(4, 2) * max(4, 2) = 42 + 2*4 = 50

Input: K = 487, N = 2
Output: 519
Explanation:
A1 = 487
A2 = A1 + minDigit( A1 ) * maxDigit( a1 ) = 487 + min(4, 8, 7) * max(4, 8, 7) = 487 + 4*8 = 519

## Recommended: Please try your approach on {IDE} first, before moving on to the solution.

Approach:

Let us try to see some observations,

When K = 1, the sequence becomes: 1, 2, 6, 42, 50, 50, 50, …
When K = 2, the sequence becomes: 2, 6, 42, 50, 50, 50, …
.
.
When K = 5, the sequence becomes: 5, 30, 30, 30, 30, 30, …
.
.
Similarly, When K = 10, the sequence becomes: 10, 10, 10, 10, 10, 10, …

From the above examples, it can be observed that the sequence eventually stops increasing after an integer has at least one digit becomes 0. If any digit becomes 0, then the minimum digit would be always 0 and after that, all the integers in the sequence remain the same.

So the approach is to find the terms of the sequence till any 0 is encountered in the digits of the current term,

Below is the implementation of the above approach.

## C++

 `// C++ program for the above approach. ` ` `  `#include ` `using` `namespace` `std; ` ` `  `// Function to find integer ` `int` `find(``int` `K, ``int` `N) ` `{ ` ` `  `    ``// because 1st integer is K itself ` `    ``N--; ` ` `  `    ``while` `(N--) { ` `        ``int` `curr_term = K; ` ` `  `        ``// Initialize min_d and max_d ` `        ``int` `min_d = 9; ` `        ``int` `max_d = 0; ` ` `  `        ``while` `(curr_term > 0) { ` `            ``int` `r = curr_term % 10; ` ` `  `            ``// updating min_d and max_d ` `            ``min_d = min(min_d, r); ` `            ``max_d = max(max_d, r); ` ` `  `            ``curr_term = curr_term / 10; ` `        ``} ` ` `  `        ``// break if min digit is 0 ` `        ``if` `(min_d == 0) { ` `            ``break``; ` `        ``} ` ` `  `        ``K = K + min_d * max_d; ` `    ``} ` ` `  `    ``return` `K; ` `} ` ` `  `// Driver code ` `int` `main() ` `{ ` `    ``int` `K = 487; ` `    ``int` `N = 2; ` ` `  `    ``cout << find(K, N) << endl; ` ` `  `    ``return` `0; ` `} `

## Java

 `// Java program for the above approach. ` `import` `java.util.*; ` ` `  `class` `GFG{ ` ` `  `// Function to find integer ` `static` `int` `find(``int` `K, ``int` `N) ` `{ ` ` `  `    ``// Because 1st integer is K itself ` `    ``N--; ` ` `  `    ``while` `(N-- != ``0``)  ` `    ``{ ` `        ``int` `curr_term = K; ` ` `  `        ``// Initialize min_d and max_d ` `        ``int` `min_d = ``9``; ` `        ``int` `max_d = ``0``; ` ` `  `        ``while` `(curr_term > ``0``) ` `        ``{ ` `            ``int` `r = curr_term % ``10``; ` ` `  `            ``// Updating min_d and max_d ` `            ``min_d = Math.min(min_d, r); ` `            ``max_d = Math.max(max_d, r); ` ` `  `            ``curr_term = curr_term / ``10``; ` `        ``} ` ` `  `        ``// Break if min digit is 0 ` `        ``if` `(min_d == ``0``) ` `        ``{ ` `            ``break``; ` `        ``} ` `        ``K = K + min_d * max_d; ` `    ``} ` `    ``return` `K; ` `} ` ` `  `// Driver code ` `public` `static` `void` `main(String[] args) ` `{ ` `    ``int` `K = ``487``; ` `    ``int` `N = ``2``; ` ` `  `    ``System.out.print(find(K, N) + ``"\n"``); ` `} ` `} ` ` `  `// This code is contributed by 29AjayKumar `

## Python3

 `# Python3 program for the above approach.  ` ` `  `# Function to find integer  ` `def` `find(K, N): ` `     `  `    ``# Because 1st integer is K itself  ` `    ``N ``=` `N ``-` `1` `     `  `    ``for` `i ``in` `range``(``0``, N): ` `        ``curr_term ``=` `K ` `         `  `        ``# Initialize min_d and max_d  ` `        ``min_d ``=` `9` `        ``max_d ``=` `0` `         `  `        ``while` `curr_term > ``0``: ` `            ``r ``=` `int``(curr_term ``%` `10``) ` `             `  `            ``# Updating min_d and max_d  ` `            ``min_d ``=` `min``(min_d, r) ` `            ``max_d ``=` `max``(max_d, r) ` `             `  `            ``curr_term ``=` `int``(curr_term ``/` `10``) ` `         `  `        ``# Break if min digit is 0  ` `        ``if` `min_d ``=``=` `0``: ` `           ``break` `         `  `        ``K ``=` `K ``+` `min_d ``*` `max_d ` `        ``return` `K ` ` `  `# Driver code  ` `K ``=` `487` `N ``=` `2` ` `  `print``(find(K, N)) ` ` `  `# This code is contributed by ishayadav181 `

## C#

 `// C# program for the above approach. ` `using` `System; ` ` `  `class` `GFG{ ` ` `  `// Function to find integer ` `static` `int` `find(``int` `K, ``int` `N) ` `{ ` ` `  `    ``// Because 1st integer is K itself ` `    ``N--; ` ` `  `    ``while` `(N-- != 0)  ` `    ``{ ` `        ``int` `curr_term = K; ` ` `  `        ``// Initialize min_d and max_d ` `        ``int` `min_d = 9; ` `        ``int` `max_d = 0; ` ` `  `        ``while` `(curr_term > 0)  ` `        ``{ ` `            ``int` `r = curr_term % 10; ` ` `  `            ``// Updating min_d and max_d ` `            ``min_d = Math.Min(min_d, r); ` `            ``max_d = Math.Max(max_d, r); ` ` `  `            ``curr_term = (``int``)(curr_term / 10); ` `        ``} ` ` `  `        ``// Break if min digit is 0 ` `        ``if` `(min_d == 0)  ` `        ``{ ` `            ``break``; ` `        ``} ` ` `  `        ``K = K + min_d * max_d; ` `    ``} ` `    ``return` `K; ` `} ` ` `  `// Driver code ` `public` `static` `void` `Main() ` `{ ` `    ``int` `K = 487; ` `    ``int` `N = 2; ` ` `  `    ``Console.Write(find(K, N)); ` `} ` `} ` ` `  `// This code is contributed by Code_Mech `

Output:

```519
```

Time Complexity: O(N)

Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.

My Personal Notes arrow_drop_up Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

Article Tags :
Practice Tags :

2

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.