Fraga
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^9+ 7.
Answers
Answered by
0
Answer:
Question: Indumati And Fraction 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 question hasn't been answered yet
Ask an expert
Indumati and Fraction Problem Description Indumati has been given an array consisting of A ones and B zeroes One operation is
22 min 135 sec 0/6 Attempted Example Input Input 1: B: 1 C: 2 Input 2: A: 2 B: 2 C: 2 Example Output Output 1: 1 Output 2: Ex
Similar questions