整数因子分解问题 大于1 的正整数n可以分解为：n=x1*x2*…*xm。对于给定的正整数n，编程计算n共有多少种不同的分解式-Integer factorization problem of positive integer greater than 1 for n can be decomposed: n = x1* x2* ...* xm. For a given positive integer n, calculated the total number of n different