Number Theory Problem

Правка en1, от Omar_Morsi, 2017-11-21 00:42:59

Can you provide a Greedy solution for the following problem ?

Given N <= 1e18 , M <= 10,000

Provide an array D = [d1, d2, d3, ... , dk] , such that d1 * d2 * d3 * ... * dk = N, di <= M, k should be minimized, or print impossible.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Omar_Morsi 2017-11-21 00:42:59 260 Initial revision (published)