#include<stdio.h>
double f(double x,int n);
double js1(double z,int b);
int main()
{
double x;
int n;
scanf("%lf%d",&x,&n);
printf("%.2lf",f(x,n));
}
double f(double x,int n)
{
double sum;
double b;
if(n= =0) return 0;
int z;
if(n%2==0) z=-1;
else z=1;
b=z*js1(x,n);
sum=b+f(x,n-1);
return sum;
}
double js1(double x,int n)
{
if(n==0) return 1;
return x*js1(x,n-1);
}
递归求式子和:用递归的方法对下列计算式子编写一个函数,并写出相应主函数。 f(x,n)=x-x2+x3-x4+……+(-1)(n-1)xn (n>0)
最新推荐文章于 2022-11-06 23:21:31 发布