test/cpv/aizu-cgl/cgl_3_b.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/all/CGL_3_B | ||
| 2 | #include "../../../src/geo2d/ds/po/lib.hpp" | ||
| 3 | |||
| 4 | using namespace tifa_libs; | ||
| 5 | using poly = polygon<double>; | ||
| 6 | |||
| 7 | 32 | int main() { | |
| 8 |
1/2✓ Branch 2 taken 32 times.
✗ Branch 3 not taken.
|
32 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 9 | u32 n; | ||
| 10 |
1/2✓ Branch 1 taken 32 times.
✗ Branch 2 not taken.
|
32 | std::cin >> n; |
| 11 | 32 | poly p(n); | |
| 12 | 32 | std::cin >> p; | |
| 13 |
2/4✓ Branch 2 taken 32 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 32 times.
✗ Branch 6 not taken.
|
32 | std::cout << p.is_convex() << '\n'; |
| 14 | 32 | return 0; | |
| 15 | 32 | } | |
| 16 |