Let us change our traditional attitude to the construction of programs. Instead of imagining that our main task is to instruct a computer what to to, let us concentrate rather on explaining to human beings what we want a computer to do. Donald Knuth

Dice Throw Problem

Language Java | Level Intermediate | Category Algorithms | August 4, 2015 9:09 am


Algorithm Problem Description

Find the number of ways to get the summation of values on each face when all dice thrown. We have N dice with M faces.

Output

          	        
          	        

The number of faces in Dice: 6
The number of throws: 6
The Summation of all throws: 30
Possibility of dice: 456/46656

          	        
          	        				    


Comments



Please login to add comments.