Introduction - If you have any usage issues, please Google them yourself
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 factorization
Packet : 23825781factor.rar filelist
factor\Debug
factor\factor.cpp
factor\factor.dsp
factor\factor.dsw
factor\factor.ncb
factor\factor.opt
factor\factor.pdf
factor\factor.plg
factor\input.txt
factor\output.txt
factor