Question

Given a sorted array, find how many numbers of length b are possible whose value is less than number c.

Answer 1

Step-by-step explanation:

Given a set of digits A[] in sorted order and two integers N and K, the task is to find how many numbers of length N are possible whose value is less than K and the digits are from the given set only. Note that you can use the same digit multiple times.

Examples:

Input: A[] = {0, 1, 5}, N = 1, K = 2

Output: 2

Only valid numbers are 0 and 1.

Input: A[] = {0, 1, 2, 5}, N = 2, K = 21

Output: 5

10, 11, 12, 15 and 20 are the valid numbers.