Description: The positive integer n greater than 1 can be decomposed as follows: n = x1* x2* ...* xm. For example, when n = 12, a total of eight different decomposition of the formula: 12 = 12 12 = 6* 2 12 = 4* 3 12 = 3* 4 12 = 3* 2* 2 12 = 2* 6 12 = 2* 3* 2 12 = 2* 2* 3. Programming tasks: For a given positive integer n, programming n Total number of different decomposition.
To Search:
File list (Check if you may need any files):
整数因子分解问题\1_3\1_3.dsp
................\...\1_3.plg
................\...\Debug\1_3.exe
................\...\.....\1_3.ilk
................\...\.....\1_3.obj
................\...\.....\1_3.pch
................\...\.....\1_3.pdb
................\...\.....\vc60.idb
................\...\.....\vc60.pdb
................\...\input.txt
................\...\output.txt
................\1_3.cpp
................\1_3.dsw
................\1_3.ncb
................\1_3.opt
................\...\Debug
................\1_3
整数因子分解问题
Download