数学模型1:S=S+(-1)^n+1/(2n-1)!
int main()
{
int i,n,j,sign=1;
float s,t=1;
while(scanf("%d",&n))
{
s=1;
for(i=2;i<=n;i++)
{
t=1;
for(j=1;j<=2*i-1;j++)
t=t*j;
sign=1;
for(j=1;j<=i+1;j++)
sign=-sign;
s=s+sign/t;
}
printf("%f\n",s);
}
return 0;
}
效率太低为O(n^2),原因是每一次求阶乘时都从1开始累乘
数学模型2:Sn=Sn-1+(-1)^n+1An,An=An-1*1/(2n-2)(2n-1)
int main()
{
int i,n,j,sign=1;
float s,t=1;
while(scanf("%d",&n))