Package g1701_1800.s1735_count_ways_to_make_array_with_product

Class Solution

java.lang.Object
g1701_1800.s1735_count_ways_to_make_array_with_product.Solution
public class Solution extends Object
1735 - Count Ways to Make Array With Product.<p>Hard</p> <p>You are given a 2D integer array, <code>queries</code>. For each <code>queries[i]</code>, where <code>queries[i] = [n<sub>i</sub>, k<sub>i</sub>]</code>, find the number of different ways you can place positive integers into an array of size <code>n<sub>i</sub></code> such that the product of the integers is <code>k<sub>i</sub></code>. As the number of ways may be too large, the answer to the <code>i<sup>th</sup></code> query is the number of ways <strong>modulo</strong> <code>10<sup>9</sup> + 7</code>.</p> <p>Return <em>an integer array</em> <code>answer</code> <em>where</em> <code>answer.length == queries.length</code><em>, and</em> <code>answer[i]</code> <em>is the answer to the</em> <code>i<sup>th</sup></code> <em>query.</em></p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> queries = [[2,6],[5,1],[73,660]]</p> <p><strong>Output:</strong> [4,1,50734910]</p> <p><strong>Explanation:</strong> Each query is independent.</p> <p>[2,6]: There are 4 ways to fill an array of size 2 that multiply to 6: [1,6], [2,3], [3,2], [6,1].</p> <p>[5,1]: There is 1 way to fill an array of size 5 that multiply to 1: [1,1,1,1,1].</p> <p>[73,660]: There are 1050734917 ways to fill an array of size 73 that multiply to 660. 1050734917 modulo 10<sup>9</sup> + 7 = 50734910.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> queries = [[1,1],[2,2],[3,3],[4,4],[5,5]]</p> <p><strong>Output:</strong> [1,2,3,10,5]</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= queries.length <= 10<sup>4</sup></code></li> <li><code>1 <= n<sub>i</sub>, k<sub>i</sub> <= 10<sup>4</sup></code></li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • waysToFillArray

      public int[] waysToFillArray(int[][] queries)