文件名称:Pfacctorrr
介绍说明--下载内容均来自于网络,请自行研究使用
« 问题描述:大于1 的正整数n能分解为:n=x1*x2*…*xm。例如,当n=12 时,共有8 种不同的分解式:12=12;12=6*2;12=4*3;12=3*4;12=3*2*2;1112=2*6;12=2*3*2;12=2*2*3。« 编程与开发任务:对于给定的正整数n,编程与开发计算n共有多少种不同的分解式。« 数据输入:由文件input.txt给出输入数据。
-« Descr iption of the problem: the positive integer n greater than 1 can be decomposed as: n = x1* x2* ...* the xm. For example, when n = 12, a total of eight different decomposition: 12 = 12 12 = 6* 2 12 = 4* 3 12 = 3* 4 12 = 3* 2* 2 1112 = 2* 6 12 = 2* 3* 2 12 = 2* 2* 3. « Programming and development tasks: calculating n the total number of different decomposition type for a given positive integer n, programming and development. « Data Input: the input data given by the file input.txt.
-« Descr iption of the problem: the positive integer n greater than 1 can be decomposed as: n = x1* x2* ...* the xm. For example, when n = 12, a total of eight different decomposition: 12 = 12 12 = 6* 2 12 = 4* 3 12 = 3* 4 12 = 3* 2* 2 1112 = 2* 6 12 = 2* 3* 2 12 = 2* 2* 3. « Programming and development tasks: calculating n the total number of different decomposition type for a given positive integer n, programming and development. « Data Input: the input data given by the file input.txt.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Pfacctorrr\1\factor.cpp
..........\.\factor.pdf
..........\.\factor.ppt
..........\1
Pfacctorrr
..........\.\factor.pdf
..........\.\factor.ppt
..........\1
Pfacctorrr