Location:
Search - factor integer
Search list
Description: 如果一个数恰好等于它的因子之和，则称该数为“完全数”。
*题目分析与算法设计
根据完全数的定义，先计算所选取的整数a(a的取值1~1000)的因子，将各因子累加于m，若m等于a，则可确认a为完全数。
*-if it is equal to the sum of the factor, says the number of "totally few." * Topic analysis and algorithm design based on the definition of full, first calculated by a selection integer (a value of 1 ~ 1000) factor, the factor will accumulate in m, if m = a, can be recognized for a number of completely. *
Platform: |
Size: 853 |
Author: 姚紫欣 |
Hits:
Description: some simple but time wasting math logic
一些不难但麻烦（适合用电脑作）的数学函数的源码
1.Test for Prime numbers
2.Find the factorial of a number
3.Find the triangle(total sum) of a number
4.Reverse every integer of a number
5.Find any power of any value
6.Find the greatest common factor of 2 -some simple but time wasting some math logic difficult but trouble (suitable for use as computer) mathematical function source 1.Test for Prime number 's 2.Find the factorial of a number 3.Find the tri angle (total sum) of a number in every 4.Reverse teger of a number 5.Find any power of any value 6. Find the greatest common factor of two
Platform: |
Size: 1580 |
Author: jeffery |
Hits:
Description: 如果一个数恰好等于它的因子之和，则称该数为“完全数”。
*题目分析与算法设计
根据完全数的定义，先计算所选取的整数a(a的取值1~1000)的因子，将各因子累加于m，若m等于a，则可确认a为完全数。
*-if it is equal to the sum of the factor, says the number of "totally few."* Topic analysis and algorithm design based on the definition of full, first calculated by a selection integer (a value of 1 ~ 1000) factor, the factor will accumulate in m, if m = a, can be recognized for a number of completely.*
Platform: |
Size: 1024 |
Author: 姚紫欣 |
Hits:
Description: some simple but time wasting math logic
一些不难但麻烦（适合用电脑作）的数学函数的源码
1.Test for Prime numbers
2.Find the factorial of a number
3.Find the triangle(total sum) of a number
4.Reverse every integer of a number
5.Find any power of any value
6.Find the greatest common factor of 2 -some simple but time wasting some math logic difficult but trouble (suitable for use as computer) mathematical function source 1.Test for Prime number 's 2.Find the factorial of a number 3.Find the tri angle (total sum) of a number in every 4.Reverse teger of a number 5.Find any power of any value 6. Find the greatest common factor of two
Platform: |
Size: 1024 |
Author: jeffery |
Hits:
Description: 将一个正整数分解质因数。例如：输入90,打印出90=2*3*3*5。
程序分析：对n进行分解质因数，应先找到一个最小的质数k，然后按下述步骤完成：
(1)如果这个质数恰等于n，则说明分解质因数的过程已经结束，打印出即可。
(2)如果n<>k，但n能被k整除，则应打印出k的值，并用n除以k的商,作为新的正整数你n,
重复执行第一步。
(3)如果n不能被k整除，则用k+1作为k的值,重复执行第一步。
-Will be a positive integer decomposition of the quality factor. For example: enter 90, print out 90 = 2* 3* 3* 5. Program analysis: the decomposition of n quality factor, should be to find a smallest prime number k, then complete the following steps: (1) If the prime number exactly equal to n, is illustrated in the process of decomposition of the quality factor has come to an end, you can print out . (2) If n
Platform: |
Size: 2048 |
Author: 雷中科 |
Hits:
Description: 这是一个将32位16进制的结果成功转化位10进制结果（对应时钟周期的整数倍），并且乘了分频因之后得出的时差，算出了相应的距离值。分频因子为1，对应周期50ns；2 对应100ns，以此类推-This is a 32-bit 16-band results of the successful transformation of 10-bit hexadecimal results (corresponding to the integer multiple clock cycles), and by the sub-band due to arrive after the time difference to calculate the corresponding distance value. Frequency factor is 1, the corresponding cycle of 50ns 2 corresponds to 100ns, and so on
Platform: |
Size: 3214336 |
Author: yanping |
Hits:
Description: 将一个很大(最大为29位整数79228162514264337593543950335,即2^96-1)分解成最小的质因数并以指数结果显示,分解速度视情况而定,如果这个数的因数多,则较快,反之则慢.
-Will be a very large (a maximum of 29 integer 79228162514264337593543950335, that is 2 ^ 96-1) into the smallest quality factor and the index results showed that the decomposition rate as the case may be, if the number of multi-factor, then faster, and vice versa is slow.
Platform: |
Size: 687104 |
Author: jinzhy002 |
Hits:
Description: 题目：将一个正整数分解质因数。例如：输入90,打印出90=2*3*3*5。
程序分析：对n进行分解质因数，应先找到一个最小的质数k，然后按下述步骤完成：
(1)如果这个质数恰等于n，则说明分解质因数的过程已经结束，打印出即可。
(2)如果n<>k，但n能被k整除，则应打印出k的值，并用n除以k的商,作为新的正整数你n,
重复执行第一步。
(3)如果n不能被k整除，则用k+1作为k的值,重复执行第一步。 -Title: will be a positive integer decomposition of the quality factor. For example: enter 90, print out 90 = 2* 3* 3* 5. Program analysis: the decomposition of n quality factor, should be to find a smallest prime number k, then complete the following steps: (1) If the prime number exactly equal to n, is illustrated in the process of decomposition of the quality factor has come to an end, you can print out . (2) If n <> k, but n can be divisible by k, it should print out the value of k, and k of n divided by the number of providers, as a new positive integer you n, repeat the first step. (3) If n can not be divisible by k, then use k+ 1 as k values, repeat the first step.
Platform: |
Size: 1024 |
Author: huhaibin |
Hits:
Description: 整数因子的求解方法，用C++设计，对C++初学者有帮助-Integer factor solution, using C++ Design, C++ Beginners help
Platform: |
Size: 4096 |
Author: 成龙 |
Hits:
Description: 小数在计算机内有两种表现形式定点数和浮点数。在定点机中，由于小数点的位置固定不变，以此当机器处理的数不是纯小数或纯整数的时候，必须乘上一个比例因子，否则会产生“溢出”。而实际上计算机处理的数不一定是纯小数或纯整数，而且有些数据的数值范围相差很大，不能直接用定点小数或定点整数表示，必须用浮点数来表示。浮点数的表示精度要比定点数高的多。要求用定点运算来仿真浮点运算，用定点数运算的思想去实现浮点数的运算。-Decimals in the computer, there are two manifestations of fixed-point and floating-point numbers. In the fixed-point machine, because of the location of the decimal point is fixed, as when dealing with a number of machines is not pure decimal or pure integer, the ratio must be multiplied by a factor, otherwise will have a spillover. In fact a number of computer processing is not necessarily the pure decimal or pure integer, and some of the numerical range of data varied widely, not directly with fixed-point or fixed-point decimal integer that must be expressed in floating-point numbers. Floating-point precision than that of fixed-point higher. Asked to use fixed-point calculations to simulate floating-point operations with fixed-point computation to realize the idea of floating point arithmetic.
Platform: |
Size: 1913856 |
Author: 李焱 |
Hits:
Description: 整数因子分解问题 大于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 factorization
Platform: |
Size: 485376 |
Author: lin |
Hits:
Description: 随机生成用户要求个数的整数，生成二叉树（无重复），
可以进行生成、遍历、查找二叉树，而且进行动态的查找，
如果没有找到节点就把这个值接到树上
能够显示节点的产生顺序、平衡因子（失败），节点值-Randomly generated integer number of user requirements to generate binary tree (without repetition), can be generated, ergodic, binary tree search, and dynamically find, if they did not find this value from the node tree to display nodes have the order, balance factor (failure), the node value
Platform: |
Size: 2048 |
Author: leeocean |
Hits:
Description: 这个程序,能够对于读入的一个正整数,把它的所有质因子找出来.代码简短,简洁,而且效率很好.-This process, that can read a positive integer, and all of its quality factor to find out. Code short, concise, and very good efficiency.
Platform: |
Size: 1024 |
Author: li |
Hits:
Description: pollard算法，用于求整数的一个因子,时间复杂度为O(n^1/4)-Pollard algorithm, used to seek an integer factor, the time complexity is O (n ^ 1/4)
Platform: |
Size: 1024 |
Author: nxliliang |
Hits:
Description: 如何在输入一个整数的时候，利用c++语言求它的因子- how to Find an integer factor of how translation
Platform: |
Size: 11264 |
Author: huangguopin |
Hits:
Description: 读入一个整数，显示它的所有的素数因子。例如，读入120，输出2,2,2,3,5-Read an integer, it shows all the prime factors. For example, read 120, the output 2,2,2,3,5
Platform: |
Size: 2048 |
Author: 眭骏 |
Hits:
Description: 将一个正整数分解质因数。例如：输入90,打印出90=2*3*3*5。-A positive integer decomposition of the quality factor. For example: Type 90, print 90 = 2* 3* 3* 5.
Platform: |
Size: 2048 |
Author: 朵拉 |
Hits:
Description: N的阶乘
【问题描述】
精确计算Ｎ的阶乘。其中，N可能是小于200的任意正整数。
【输入形式】
输入文件为当前目录下的factor.in。 该文件只包含一个正整数，表示需要求该正整数的阶乘。
【输出形式】
输入文件为当前目录下的factor.out。 该文件只包含一个正整数，表示该正整数的阶乘。50个数字为一行
【输入样例】
57
【输出样例】
40526919504877216755680601905432322134980384796226
602145184481280000000000000
【时间限制】
1s
【空间限制】
65536KB-N factorial [Problem Description] accurately calculate N factorial. Where, N may be any positive integer less than 200. [Input type] input file for the current directory factor.in. This file contains only a positive integer representing the request of the factorial of a positive integer. [Output format] input file for the current directory factor.out. This file contains only a positive integer that represents the factorial of a positive integer. 50 digital input sample as a row [] 57 [] 40526919504877216755680601905432322134980384796226 602145184481280000000000000 output sample [time limit] [1s] 65536KB space limitations
Platform: |
Size: 649216 |
Author: 余洪坤 |
Hits:
Description: 算法：
对于给定正整数n，计算n共有多少种不同的分解式。-Algorithm:
For a given positive integer n, n calculate how many different factorization total.
Platform: |
Size: 1024 |
Author: 盖先生 |
Hits:
Description: 用c语言将一个正整数分解质因数,代码条理非常清晰-Using c language will be a positive integer decomposition of the quality factor, the code is very clear structured
Platform: |
Size: 7168 |
Author: 王少杰 |
Hits: