+2!+3!+.+N!的算法,void fun(int n){int temp = 1;int sum = 0;int i;for (i=0;i
来源:学生作业帮助网 编辑:作业帮 时间:2024/08/02 07:09:10
![+2!+3!+.+N!的算法,void fun(int n){int temp = 1;int sum = 0;int i;for (i=0;i](/uploads/image/z/14559091-43-1.jpg?t=%2B2%21%2B3%21%2B.%2BN%21%E7%9A%84%E7%AE%97%E6%B3%95%2Cvoid+fun%28int+n%29%7Bint+temp+%3D+1%3Bint+sum+%3D+0%3Bint+i%3Bfor+%28i%3D0%3Bi)
x)6R6VS|>6O)LQH++QӬQ%
Nqi.m fgZ)hd6IE؍ˠ(6E`2!L$lh⋼g맼tC?gӷ=mlg@A20doP2鲦g<]ɮ6>v-zھg[_t<[Cc6>3Χ^ll_NyF 1[
+2!+3!+.+N!的算法,void fun(int n){int temp = 1;int sum = 0;int i;for (i=0;i
+2!+3!+.+N!的算法,
void fun(int n)
{
int temp = 1;
int sum = 0;
int i;
for (i=0;i
+2!+3!+.+N!的算法,void fun(int n){int temp = 1;int sum = 0;int i;for (i=0;i
n比较小的时候是没问题的
但是n如果大了就有可能溢出
经测试,当n=13时就会溢出等到负数的答案