搜索资源列表
stairs
- 一个用数组的方法解决大数、巨数的阶乘结果越界问题的算法.-an array of methods used to solve large numbers, the huge number of cross-border issues results factorial algorithm.
bigdata
- 实现不超过100的数的阶乘！用数组实现打出的存储，与去放！-not achieve more than 100 the number of factorial! Making use of the array to achieve the storage, and up to!
100!
- 100阶乘的数组存储算法-100 factorial array storage algorithm
3000!
- 这里是通过数组求大数阶乘的一种方法，这里类举3000，其他的类推-This is the factorial of large numbers through the array for a way to cite here, type 3000, the other by analogy
jiecheng
- 在VC++中利用数组来实现超大整数的阶乘-In VC++ Use the array to achieve super-integer factorial
2008.12.1
- 计算大数的阶乘，用的链表和数组的方法。 用于学习-Calculation of the factorial of large numbers, using the linked list and array method. For learning
Cchengxu
- 这个程序包包括了C语言中的一些常见的程序，如阶乘，读取二进制文件，递归，二维数组平均值排序等几十个程序。有了这些程序，会更好的进行科学计算-This package includes the C language of some common procedures, such as factorial, read binary files, recursion, sorting, such as the average of two-dimensional array of dozens of
counter
- 100以内阶乘计算（运用数组），运算速度很快，效率很高，望采纳-100 within the factorial calculation (the use of the array), computing fast, efficient, hope to adopt
jiecheng
- 实现 任意数的阶乘 利用数组扩展位数 底层算法 -Arbitrary implementation of the factorial number of the median use the expansion of the bottom of the array algorithm
1_Factorial
- 计算10000的阶乘，结果存储在out.txt中。 如果算更大的数，注意更改数组大小。-10000 calculated the factorial, the result is stored in the in out.txt. If a greater number of operators, pay attention to changes in the size of the array.
mul
- 计算大数阶乘,用数组的方法来计算一个大数的阶乘,可以算几万的介乘-Calculate factorial of large numbers, using an array of methods to calculate a factorial of large numbers can be counted by tens of thousands of mediated
mul
- 一般c++的Int型变量为4个字节，做数字比较大整数的阶乘会溢出，本程序利用数组实现大数字的阶乘且可以更改数组的长度-General c++ of the Int variable is 4 bytes, so the number will be relatively large factorial integer overflow, the process utilizes an array to achieve great numbers factorial and can change
C
- 1、1+1/2+1/3+……+1/n 2、键盘输入任何数字，求其阶乘 3、数组输入和输出 4、求数组的max和min -1,1+1/2+1/3+ ... ...+1/n 2, keyboard input any number, find its factorial 3, an array of input and output 4, seeking an array of max and min
java
- 用JAVA编写的小程序，实现打印成绩等级，数组排序，阶乘等功能，适合于初学者-Small programs written using JAVA, achieving print Grade, array sorting, factorial functions, suitable for beginners
1000s--Factorial
- 输入不超过1000的正整数，输出n!=1X2X3....Xn的精确结果 1000!大约等于4*10^2567，因此可以用一个3000个元素的数组f保存，为了方便我们从低位起保存位数据，再倒序输出，即f[0]保存个位，其他类推 每次只需要模拟手算即可完成n!，输出时要忽略前导0-Enter a positive integer less than 1000, Output n! = 1X2X3 .... Xn accurate results 1000! Approximately equ
TarsusFactorial
- 用数组储存大数，然后递归实现阶乘，计算完成后将计算的结果存入数组中，然后输出结果即可。-With an array of storage of large numbers, and then the recursive factorial implementation, which will calculate the result of calculation into the array, then the output can be.
gaojingdu
- 高精度算法，属于处理大数字的数学计算方法。在一般的科学计算中,会经常算到小数点后几百位或者更多，当然也可能是几千亿几百亿的大数字。一般这类数字我们统称为高精度数，高精度算法是用计算机对于超大数据的一种模拟加,减,乘,除,乘方,阶乘,开方等运算。对于非常庞大的数字无法在计算机中正常存储，于是，将这个数字拆开，拆成一位一位的，或者是四位四位的存储到一个数组中， 用一个数组去表示一个数字，这样这个数字就被称谓是高精度数。高精度算法就是能处理高精度数各种运算的算法。 -High-precision
3
- c语言的求n的阶乘的程序代码 数组，指针，函数，函数调用-c language code of n factorial array, pointer, function, function call
Large-integer-factorial
- 本实例实现了一个计算大整数阶乘的程序。通常使用递归来计算一个整数的阶乘。但是， 因为ii.算本身能够表示的最大整数是有限的，所以能够计算的阶乘整数要受到限制。本程序使 用数组来存储结果，因而很好地解决了这个问题,只要有足够大的数组就能计.任意大的整数0-Examples of the realization of a to calculate large integer factorial program. Usually use recursion to calculate the facto
Factorial-algorithm
- 实现100！的算法。因为直接用int会出现溢出，本方法是将结果按位放入int类型的数组中。-Achieve 100! Algorithm. Because the direct use int overflow occurs, the result of this method is to put the array bit int type.