向量三角形

转载：http://www.cnblogs.com/hsqdboke/archive/2012/04/29/2476115.html

代码：

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<set>
#include<stack>
#include<map>
#include<queue>
#include<functional>
#include<cstdlib>
using namespace std;
#pragma warning(disable:4996)
#define INF 1<<20
#define esp 1e-9
double area(double x0, double y0, double x1, double y1, double x2, double y2)
{
return fabs(x0*y1+x2*y0+x1*y2-x2*y1-x0*y2-x1*y0);
}


int main()
{
double x0, y0, x1, y1, x2, y2;
while (scanf("%lf%lf%lf%lf%lf%lf", &x0, &y0, &x1, &y1, &x2, &y2) != EOF)
{
int cnt = 0;
for (int i = 1; i <= 99; i++)
{
double s0, s1, s2, s3;
for (int j = 1; j <= 99; j++)
{
s0= area(i*1.0,j*1.0,x0, y0, x1, y1);
s1 = area(i*1.0, j*1.0, x2, y2, x0, y0);
s2 = area(i*1.0, j*1.0, x1, y1, x2, y2);
s3 = area(x0,y0,x1,y1,x2,y2);
if (s0 >= 0 && s1 >= 0 && s2 >= 0 && s3 >= 0 && fabs(s3-s0-s1-s2)<esp)
cnt++;
else if (s0 <= 0 && s1 <= 0 && s2 <= 0 && s3 <= 0 && fabs(s3 - s0 - s1 - s2)<esp)
cnt++;
}
}
printf("%d\n", cnt);
}
system("pause");
return 0;
}