#include<iostream>
#include<cmath>
using namespace std;
double djf(double a,double b,int n);
double fun(double x);
int main()
{
double a,b;
int n;
cout<<"请输入积分下限"<<endl;
cin>>a;
cout<<"请输入积分上限"<<endl;
cin>>b;
cout<<"请输入分割的份数"<<endl;
cin>>n;
cout<<djf(a,b,n);
}
double djf(double a,double b,int n)
{
double w; //每个小矩形的面积
double k=(b-a)/n;//k就是每个矩形的底
double s=0.0;
for(int i=1;i<=n;i++)
{
w=fun(a+(i-1)*k)*k;
s=s+w;
}
return s;
}
double fun(double x)
{
return 2*x;
}
//只有把分割数越多,s才会越接近用牛莱公式算出来的答案,因为分割数越多,越接近矩形,但不会相等