Address:http://acm.nyist.net/JudgeOnline/problem.php?pid=68
这个题目就是
三角形顺时针和逆时针的判定,参考地址:http://blog.csdn.net/sjl_leaf/article/details/8789785
看了参考资料基本这题无压力了。
#include<iostream>
using namespace std;
int main()
{
int x1,x2,x3,y1,y2,y3;
while(cin>>x1>>y1>>x2>>y2>>x3>>y3&&(x1||x2||x3||y1||y2||y3))
{
int i=(x2-x1)*(y3-y1)-(x3-x1)*(y2-y1);
if(i<0) cout<<"1"<<endl;
else cout<<"0"<<endl;
}
return 0;
}