BOJ 11758 CCW

1 개요

BOJ 11758 CCW

• 백준 온라인 저지 11758번 문제
• BOJ 39단계

2 C++

#include <iostream>
using namespace std;

struct P {
    int x;
    int y;
};
P p1, p2, p3;

void solve() {
	int area = ((p2.x-p1.x)*(p3.y-p1.y)) - ((p2.y-p1.y)*(p3.x-p1.x));
	if (area > 0) {
	    cout << 1;
	    return;
	}
	if (area < 0) {
	    cout << -1;
	    return;
	}
	cout << 0;
}

int main() {
	cin >> p1.x >> p1.y;
	cin >> p2.x >> p2.y;
	cin >> p3.x >> p3.y;
    solve();
}