Vidyalelo
Data Structure · Q145

Dynamic Programming in Data Structures

Programming · Data Structure · question 145

Q145

There are n dice with f faces. The faces are numbered from 1 to f. What is the minimum possible sum that can be obtained when the n dice are rolled together?

A.
1
B.
f
C.
n
Answer
D.
n*f

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board