Skip to main content

All Questions

Filter by
Sorted by
Tagged with
7 votes
3 answers
2k views

Find the total number of ways W, in which a sum S can be reached in N throws of a dice

I was solving this question: Given there is a 6 sided dice. Find the total number of ways W, in which a sum S can be reached in N throws. Example: S = 1, N = 6 => W = 0 S = 6, N = 6 => W =...
Harsha's user avatar
  • 1,311
19 votes
4 answers
6k views

Printing all possible sums of two n-sided dice rolls

For my CS class, we were tasked with writing a program that calculates all the possible results from rolling two n-sided dice. For example, the input of 4 would ...
intboolstring's user avatar