Vidyalelo
Data Structure · Q185

Dynamic Programming in Data Structures

Programming · Data Structure · question 185

Q185

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

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

Answer: Option D

Solution

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