Welcome![Sign In][Sign Up]
Location:
Search - factorial array

Search list

[Mathimatics-Numerical algorithmsstairs

Description: 一个用数组的方法解决大数、巨数的阶乘结果越界问题的算法.-an array of methods used to solve large numbers, the huge number of cross-border issues results factorial algorithm.
Platform: | Size: 1059 | Author: ghostfish | Hits:

[Other resourcebigdata

Description: 实现不超过100的数的阶乘!用数组实现打出的存储,与去放!-not achieve more than 100 the number of factorial! Making use of the array to achieve the storage, and up to!
Platform: | Size: 1041 | Author: 李强 | Hits:

[Mathimatics-Numerical algorithms100!

Description: 100阶乘的数组存储算法-100 factorial array storage algorithm
Platform: | Size: 872 | Author: 何丢 | Hits:

[Mathimatics-Numerical algorithmsstairs

Description: 一个用数组的方法解决大数、巨数的阶乘结果越界问题的算法.-an array of methods used to solve large numbers, the huge number of cross-border issues results factorial algorithm.
Platform: | Size: 1024 | Author: ghostfish | Hits:

[Mathimatics-Numerical algorithms100!

Description: 100阶乘的数组存储算法-100 factorial array storage algorithm
Platform: | Size: 1024 | Author: 何丢 | Hits:

[source in ebookbigdata

Description: 实现不超过100的数的阶乘!用数组实现打出的存储,与去放!-not achieve more than 100 the number of factorial! Making use of the array to achieve the storage, and up to!
Platform: | Size: 1024 | Author: 李强 | Hits:

[Otherfactorial

Description: 利用数组实现大数阶乘,初始数组设为long int,长度35000,可以实现8000以内任意数的阶乘,可以修改数组长度,改变所计算数的范围。用c实现,vc6.0环境下测试通过-Realize the use of an array of factorial of large numbers, the initial array as long int, the length of 35000, you can realize arbitrary number less than 8000 factorial, you can modify the array length, a change in the scope of calculations. With c realize, vc6.0 environment test
Platform: | Size: 1024 | Author: tumbler | Hits:

[Algorithm3000!

Description: 这里是通过数组求大数阶乘的一种方法,这里类举3000,其他的类推-This is the factorial of large numbers through the array for a way to cite here, type 3000, the other by analogy
Platform: | Size: 1024 | Author: huqiong | Hits:

[Otherjiecheng

Description: 在VC++中利用数组来实现超大整数的阶乘-In VC++ Use the array to achieve super-integer factorial
Platform: | Size: 860160 | Author: slcfn | Hits:

[Other2008.12.1

Description: 计算大数的阶乘,用的链表和数组的方法。 用于学习-Calculation of the factorial of large numbers, using the linked list and array method. For learning
Platform: | Size: 1024 | Author: wuweihua | Hits:

[OtherCchengxu

Description: 这个程序包包括了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 procedures. With these procedures, will be better for scientific computing
Platform: | Size: 14336 | Author: 郭韬 | Hits:

[Delphi VCLcounter

Description: 100以内阶乘计算(运用数组),运算速度很快,效率很高,望采纳-100 within the factorial calculation (the use of the array), computing fast, efficient, hope to adopt
Platform: | Size: 176128 | Author: 123 | Hits:

[Otherjiecheng

Description: 实现 任意数的阶乘 利用数组扩展位数 底层算法 -Arbitrary implementation of the factorial number of the median use the expansion of the bottom of the array algorithm
Platform: | Size: 549888 | Author: LG | Hits:

[Console1_Factorial

Description: 计算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.
Platform: | Size: 8192 | Author: 卡米力江 | Hits:

[Windows Developmul

Description: 计算大数阶乘,用数组的方法来计算一个大数的阶乘,可以算几万的介乘-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
Platform: | Size: 264192 | Author: guan | Hits:

[Othermul

Description: 一般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 the length of the array
Platform: | Size: 456704 | Author: gechengwei | Hits:

[AI-NN-PR1000s--Factorial

Description: 输入不超过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 equal to 4* 10 ^ 2567, so you can use a 3000 element array f preservation, for the convenience since we are saved from the low bits of data, and then reverse the output, that is, f [0] save a bit, so on the other hand each operator only needs to complete the simulation n!, leading to ignore output 0
Platform: | Size: 1024 | Author: 李娜 | Hits:

[Internet-Network3

Description: c语言的求n的阶乘的程序代码 数组,指针,函数,函数调用-c language code of n factorial array, pointer, function, function call
Platform: | Size: 9216 | Author: 李依同 | Hits:

[OS programLarge-integer-factorial

Description: 本实例实现了一个计算大整数阶乘的程序。通常使用递归来计算一个整数的阶乘。但是, 因为ii.算本身能够表示的最大整数是有限的,所以能够计算的阶乘整数要受到限制。本程序使 用数组来存储结果,因而很好地解决了这个问题,只要有足够大的数组就能计.任意大的整数0-Examples of the realization of a to calculate large integer factorial program. Usually use recursion to calculate the factorial of an integer. However, because ii. Largest integer that is limited by the operator itself can be represented, it is possible to calculate the factorial integer restrictions. This program uses an array to store the results, a good solution to this problem, as long as there is a sufficiently large array will be able to count arbitrarily large integer 0
Platform: | Size: 1024 | Author: hxk | Hits:

[OtherFactorial-algorithm

Description: 实现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.
Platform: | Size: 23552 | Author: 王杰 | Hits:
« 12 »

CodeBus www.codebus.net