Dice, is a Dynamic Programming related problem and in this post we will see how we can solve this challenge in C++

Given a Number X and 'n' die each having 'm' faces.In how many ways can we get X

Please check the main.cpp snippet for the solution.

This solution originally posted at: Github by @susantabiswas