搜索资源列表
maththe
- 数论的基础有素数删选质因数的分解公约数的求解等-On the basis of several well-established quality factor of the number of censored election decomposition to solve a few, such as the Convention
2_2
- 将一个正整数分解质因数。例如：输入90，打印出90=2*3*3*5-A quality factor decomposition of positive integer. For example: enter 90, print out the 90 = 2* 3* 3* 5
Apositiveintegerprimefactordecomposition
- 将一个正整数分解质因数。例如：输入90,打印出90=2*3*3*5。-A positive integer prime factor decomposition
将一个正整数分解质因数
- 题目4：将一个正整数分解质因数。例如：输入90,打印出90=2*3*3*5。 -Title 4: a positive integer decomposition of prime factors. For example: input 90, print out 90 = 2* 3* 3* 5.
fenjiezhiyinshu
- 一个小的c++编写的分解质因数程序。字符界面。仅有代码。-A small prime factor decomposition of c++ written procedures. Character interface. The only code.
jisuanjidazuoye
- 用C语言解决数学问题，包括求解高次方程，分解质因数，求连续素数之和-C language to solve mathematical problems, including solving equations of higher quality factor decomposition, seeking consecutive primes and
Desktop
- 又是一个小程序，c++的，质因数分解，很熟悉吧？-It is a small program, c++, the prime factorization, very familiar with it?
EquSvr
- 用VC++实现的简易解方程器，可以解一元一次/二次/二元一次方程，此外还提供了分解质因数/最大公约数/最小公倍数/阶乘等功能。-A simple Equation Solver with VC++, which can solve linear equation with one or two unknown and also quadratic equation with one unknown, in addition to providing a series of functions s
fjzys
- 自己写的一个分解质因数的小程序，输入一个大于3的整数，然后输出分解的结果。使用了long long型变量，19位10进制的数字基本够用了。此外，根据输出结果很容易能判断是不是质数。-To write a prime factor decomposition of a small program, enter an integer greater than 3, and then outputs the results of the decomposition. Use a long long v
jsq
- java的分解质因数，输入一个数字，比如20,就输出2*2*5-java prime factor decomposition
test
- 将一个正整数分解质因数。例如：输入90,打印出 90 2*3*3*5。-Prime decomposition of a positive integer
factors & ord
- 分解质因数 转换一串字符为ASCII码或者Unicode码(To do factor decomposition To translate a string into ASCII or Unicode)