文件名称: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 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
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
(系统自动生成,下载前可以参看下载内容)
下载文件列表
1000's Factorial.c
本网站为编程资源及源代码搜集、介绍的搜索网站，版权归原作者所有！ 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.