Problem · Math

Count Numbers with Digit Sum

Learn this problem
EasyCisco logoCiscoNEW GRADOA
See Cisco hiring insights

Problem statement

Given an integer X, write an algorithm to find the number of integers which are less than or equal to X and whose digits add up to Y.

Description Input

The first line of input consists of an integer - inputNum1, representing the given number X. The next line consists of an integer - inputNum2, representing the given number Y.

Output

Print the count of numbers whose digits add up to Y for the given number X.

Note

If no numbers are found whose digits add up to Y for the given number X, then print -1.

Function

countNumbersWithDigitSum(inputNum1: int, inputNum2: int) → int

Examples

Example 1

inputNum1 = 20inputNum2 = 5return = 2

X is 20 and Y is 5. There are only 2 integers <= 20, i.e., 5 and 14 whose digits add up to 5.

Constraints

O~O

More Cisco problems

drafts saved locally
public int countNumbersWithDigitSum(int inputNum1, int inputNum2) {
  // write your code here
}
inputNum120
inputNum25
expected2
checking account