- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

Given a positive number as the number of digits and a sum. The goal is to find all d digit numbers that have sum of digits equal to the input sum. The numbers having leading zeros will not be considered as d digit numbers.

The ranges are digits between 1 to 100 and sum between 1 and 500.

**For Example**

**Input -** digits = 3, digi_sum = 3

**Output -** Count of n digit numbers whose sum of digits equals to given sum are: 6

**Explanation -** Three digit numbers having sum of digits as 3 are:

102, 111, 120, 201, 210, and 300.

**Input -** digits = 4 digi_sum = 2

**Output -** Count of n digit numbers whose sum of digits equals to given sum are: 4

**Explanation -** Four digit numbers having sum of digits as 2 are :

1001, 1010, 1100, and 2000.

In this approach we will traverse from the first d digit number and find the first number whose sum of digits is equal to the given sum. Then increment numbers by 9 until we find the sum of digits more than the given sum. Once a number having digit sum greater than input sum is found then increment the number by 1 and find the next number with sum as input sum. Repeat this process till the last d digit number.

- Take the number of digits and sum of digits as input.
- Function digits_sum(int digits, int digi_sum) takes both input values and returns the count of n digit numbers whose sum of digits equals a given sum.
- Take the initial count as 0.
- Take the first number as Left = pow(10, digits - 1). And the last number of the range as right = pow(10, digits) - 1 ( i.e 10 and 99 for digits=2 ).
- Using a while loop traverse from left to right.
- Take first=0 and last=i.
- For each i ( last ), take the rightmost digit ( last % 10 ) and add to first. Reduce last by 10 for the next iteration.
- If first becomes equal to digi_sum then increment count and update i by 9 for next iteration.
- Otherwise increment i by 1.
- At the end of all loops we will have count as numbers that have digit sum equal to digi_sum.
- Return count as result.

#include <bits/stdc++.h> using namespace std; int digits_sum(int digits, int digi_sum) { int count = 0; int Left = pow(10, digits - 1); int right = pow(10, digits) - 1; int i = Left; while (i <= right) { int first = 0; int last = i; while (last != 0) { first = first + last % 10; last = last / 10; } if (first == digi_sum) { count++; i = i + 9; } else { i++; } } return count; } int main() { int digits = 5; int digi_sum = 7; cout << "Count of n digit numbers whose sum of digits equals to given sum are: " << digits_sum(digits, digi_sum); return 0; }

If we run the above code it will generate the following output −

Count of n digit numbers whose sum of digits equals to given sum are: 5

- Related Questions & Answers
- Print all n-digit numbers whose sum of digits equals to given sum in C++
- Find numbers whose sum of digits equals a value
- Minimum number of squares whose sum equals to given number n
- Count of N-digit Numbers having Sum of even and odd positioned digits divisible by given numbers - JavaScript
- Count numbers (smaller than or equal to N) with given digit sum in C++
- Count of numbers from range[L, R] whose sum of digits is Y in C++
- n-th number whose sum of digits is ten in C++
- Count of numbers satisfying m + sum(m) + sum(sum(m)) = N in C++
- Count the nodes in the given tree whose sum of digits of weight is odd in C++
- Sum of sum of first n natural numbers in C++
- Count of numbers between range having only non-zero digits whose sum of digits is N and number is divisible by M in C++
- Program to count number of consecutive lists whose sum is n in C++
- Finding all the n digit numbers that have sum of even and odd positioned digits divisible by given numbers - JavaScript
- Finding sum of digits of a number until sum becomes single digit in C++
- Minimum number of single digit primes required whose sum is equal to N in C++

Advertisements