the c++ code for you are going to make a necklace of n beads using k different colored beads. there are unlimited beads of each color. you need to find the expected value of number of distinct colors used, if every necklace is equiprobable to be made. two necklaces are considered same if after some rotation they are identical you need to find this value for each n from 1 to m modulo 10^9+7 problem constraints:1<=m,k<=10^5
Answers
Answered by
0
Answer:
ccm is the answer
Explanation:
Similar questions