3669. Balanced K-Factor Decomposition

Given two integers n and k, split the number n into exactly k positive integers such that the product of these integers is equal to n. Return any one split in which the maximum difference between any two numbers is minimized. You may return the result in any order. Example 1: Input: n = 100, k = 2 Output: [10,10] Explanation: The split [10, 10] yields 10 * 10 = 100 and a max-min difference