Easy exam
One day Chef had an exam on probability theory. Nothing interesting, but the exam was going fishily easy. And finally Chef got to the last question: "Suppose you have a dice with K faces with numbers from 1 to K written on it, and integers L and F(0 ). You roll it N times. Let ai be the number of times (out of the N rolls) that a face with number i written on it came up as the top face of the dic
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start