|
#2
在这里爬起2013-10-12 13:23
 程序代码：#include <iostream.h> #include <math.h> #define eps 1E-8 double f(double x) { double t; t=cos(x); return t; } void main() { int n,i; double m,s1,s3,h,a=0,b=0.8,c1,c=0.5,p,q,d; for(n=1;;n++) { double s2=0,s; m=(b-a)/(3*n); h=(b-a)/(2*n); d=f(a)-f(b); c1=c*d; for(i=1;i<=n;i++) { p=2*f(a+(2*i-1)*h); q=f(a+2*i*h); s3=p+q; s2=s2+s3; } s=m*(c1+s2); s1=((b-a)/(3*n*(n-1)))*(2*f(a+(2*n*h)-h)+f(a+2*n*h)); if(fabs(s1)<eps) { cout<<s<<endl; break; } } } |
只有本站会员才能查看附件，请 登录
#include <iostream.h>
#include <math.h>
double f(double x)
{
double t;
t=cos(x);
return t;
}
void main()
{
int n=1,i;
float m,s,s1,s2=0,s3,h,a=0,b=0.8,c=0.5,p,q,d;
double eps=1e-8;
while(fabs(f(n)-f(n-1))>=eps)
{
h=(b-a)/(2*n);
m=(b-a)/(3*n);
c=0.5;
d=f(a)-f(b);
s1=c*d;
for(i=1;i<=n;i++)
{
p=2*f(a+(2*i-1)*h);
q=f(a+2*i*h);
s3=p+q;
s2=s2+s3;
s1=m*(s1+s2);
}
cout<<s<<endl;
}
}