알고리즈1 백준(BOJ) 16190 Rising Sun ** # ccw #include #include #include using namespace std; int n; pair pos[2001]; pair home; int ans = -1; long long ccw(pair a, pairb, pair c) { return a.first * b.second - b.first*a.second + b.first *c.second - c.first *b.second + c.first * a.second - a.first * c.second; } int main() { scanf("%d", &n); for (int i = 0; i < 2 * n; i++) scanf("%lld", &pos[i].first); scanf("%lld", &home.first); for (in.. 2018. 10. 7. 이전 1 다음