Question

Problem Description
Indumati has been given an array consisting of A ones and B zeroes.
One operation is defined as follows:
• Select any C elements of the array, delete them from the array and add append their average (the irreducible fractional form) to the array.
It is guaranteed that A+B - 1 is a multiple of C-1.
Indumati repeats this operation until only 1 number (also an irreducible fraction) is left in the array.
Your task is to find the number of distinct values this fraction can take, modulo 10° + 7.​

Answer 1

Answer:

SORRY

Explanation:

I NEED SOME POINTS