c++求两个向量的交点

为什么80%的码农都做不了架构师？>>>   

#include<cstdio>
#include<cmath>
#include<iostream>
using namespace std;
struct POINT
{
  double x,y;
};
double multi(POINT p1,POINT p2,POINT p0)
{
    return (p1.x-p0.x)*(p2.y-p0.y)-(p2.x-p0.x)*(p1.y-p0.y);
}
POINT intersection(POINT a,POINT b,POINT c,POINT d)
{
    POINT p;
    p.x=(multi(a,d,c)*b.x-multi(b,d,c)*a.x)/(multi(a,d,c)-multi(b,d,c));
    p.y=(multi(a,d,c)*b.y-multi(b,d,c)*a.y)/(multi(a,d,c)-multi(b,d,c));
    return p;
}
int main(void)