include
using namespace std;
//递归法 效率很低
double lerangde(int n,double x)
{
if (n == 0)
return 1.0;
if (n == 1)
return x;
else
return ((2 * n - 1)*x - lerangde(n - 1, x) - (n - 1)*lerangde(n - 2, x))/2;
}
int main()
{
double lerangde(int n,double x);
int n;
double x;//x的值可能是小数
cout<<”请分别输入多项式系数n和变量x：”;
cin >>n>>x;
cout<