[Link] https://www.acmicpc.net/problem/11758
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <cstring>
// #include <bits/stdc++.h>
using namespace std;
#define for0(i, n) for(int i = 0; i < n; i++)
#define for1(i, n) for(int i = 1; i < n; i++)
#define fori(s, e) for(int i = s; i < e; i++)
#define ll long long
#define endl "\n"
#define nulls '\0'
#define dkdk " "
const int MAX = 5e5 + 1;
int n, m, k;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
vector<pair<int,int>> p(3);
for0(i, 3) {
cin >> p[i].first >> p[i].second;
}
int dx1 = p[0].first - p[1].first, dy1 = p[0].second - p[1].second;
int dx2 = p[2].first - p[1].first, dy2 = p[2].second - p[1].second;
int v = dy2 * dx1 - dy1 * dx2;
if(v == 0) cout << 0;
else if(v > 0) cout << -1;
else cout << 1;
return 0;
}