果园里的树》:
- ==的浮点误差:#include<math.h> fabs(a-b)<1e-9;
- 点在三角形中——平面面积:大==小+小+小
- 三角形有向面积:(x1*y2+x2*y3+x3*y1-x1*y3-x2*y1-x3*y2)/2;
- win10系统结束输入:Ctrl+C
(海伦公式——过于复杂:p=c/2;s=sqrt(p*(p-a)*(p-b)*(p-c)))
(此题用其平面面积,记公式:2S=
∣x1 y1 1∣
∣x2 y2 1∣
∣x3 y3 1∣(求行列式)
(此题比较面积时,不用fabs——有方向影响)
#include<stdio.h>
#include<math.h>
double area(double x1,double y1,double x2,double y2,double x3,double y3)
{ return fabs(x1*y2+y1*x3+x2*y3-x3*y2-x2*y1-x1*y3)/2; }
int main()
{
double ss,s1,s2,s3;
int i,j,s=0;
double x1,x2,x3,y1,y2,y3;
while (scanf("%lf %lf %lf %lf %lf %lf",&x1,&y1,&x2,&y2,&x3,&y3)==6)
{
s=0;
ss=area(x1,y1,x2,y2,x3,y3);
for (i=1; i<100; i++)
for (j=1; j<100; j++)
{ s3=area(x1,y1,x2,y2,i,j);
s2=area(x1,y1,i,j,x3,y3);
s1=area(i,j,x2,y2,x3,y3);
if (fabs(ss-s1-s2-s3)<1e-9) s++;
}
printf("%d\n",s);
}
return 0;
}