# Java: Reads n digits (given) chosen from 0 to 9 and prints the number of combinations

## Java Basic: Exercise-228 with Solution

Write a Java program that reads n digits (given) chosen from 0 to 9 and prints the number of combinations where the sum of the digits equals another given number (s). Do not use the same digits in a combination.

For example, the combinations where n = 3 and s = 6 are as follows:

1 + 2 + 3 = 6

0 + 1 + 5 = 6

0 + 2 + 4 = 6

**Input:**

Two integers as number of combinations and their sum by a single space in a line. Input 0 0 to exit.

**Visual Presentation:**

**Sample Solution:**

**Java Code:**

```
// Importing the Scanner class for user input
import java.util.*;
// Main class named "Main"
public class Main {
// Main method to execute the program
public static void main(String[] args) {
// Creating a Scanner object for user input
Scanner stdIn = new Scanner(System.in);
// Prompting the user to input the number of combinations and sum (separated by a space in a line)
System.out.println("Input number of combinations and sum (separated by a space in a line):");
// Reading the number of combinations (n) and the sum (s) from the user
int n = stdIn.nextInt();
int s = stdIn.nextInt();
// Calling the comnum method to calculate the number of combinations
int c1 = comnum(0, n, s, 0);
// Prompting the user with the number of combinations
System.out.println("Number of combinations:");
System.out.println(c1);
}
// Recursive method to calculate the number of combinations
public static int comnum(int i, int n, int s, int p) {
// Base case: If the sum (p) matches the target sum (s) and no more elements (n) are left
if (s == p && n == 0) {
return 1;
}
// Base case: If all elements are considered (i reaches 10), return 0
if (i >= 10) {
return 0;
}
// Base case: If the sum (p) exceeds the target sum (s), return 0
if (p > s) {
return 0;
}
// Recursive calls for including and excluding the current element
int c1 = comnum(i + 1, n - 1, s, p + i);
int c2 = comnum(i + 1, n, s, p);
// Returning the sum of combinations from both recursive calls
return c1 + c2;
}
}
```

Sample Output:

Input number of combinations and sum (separated by a space in a line): 3 6 Number of combinations: 3

**Flowchart: **

**Java Code Editor:**

** Contribute your code and comments through Disqus.**

**Previous:**Write a Java program which reads a text (only alphabetical characters and spaces.) and prints two words. The first one is the word which is arise most frequently in the text. The second one is the word which has the maximum number of letters.

**Next:** Write a Java program which reads the two adjoined sides and the diagonal of a parallelogram and check whether the parallelogram is a rectangle or a rhombus.

**What is the difficulty level of this exercise?**

Test your Programming skills with w3resource's quiz.

**Weekly Trends**- Python Interview Questions and Answers: Comprehensive Guide
- Scala Exercises, Practice, Solution
- Kotlin Exercises practice with solution
- MongoDB Exercises, Practice, Solution
- SQL Exercises, Practice, Solution - JOINS
- Java Basic Programming Exercises
- SQL Subqueries
- Adventureworks Database Exercises
- C# Sharp Basic Exercises
- SQL COUNT() with distinct
- JavaScript String Exercises
- JavaScript HTML Form Validation
- Java Collection Exercises
- SQL COUNT() function
- SQL Inner Join