int cross(point &a,point &b,point &c)
{
int x1=b.x-a.x;
int y1=b.y-a.y;
int x2=c.x-a.x;
int y2=c.y-a.y;
return x1*y2-x2*y1;
}
向量叉积(图解)
最新推荐文章于 2024-05-31 13:03:12 发布
int cross(point &a,point &b,point &c)
{
int x1=b.x-a.x;
int y1=b.y-a.y;
int x2=c.x-a.x;
int y2=c.y-a.y;
return x1*y2-x2*y1;
}