This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "trilib.h"
using namespace std;
int main() {
int n = get_n();
set<int> hull;
for (int i = 1; i <= n; ++i)
for (int j = i+1; j <= n; ++j) {
int occur[2] = {0, 0};
for (int k = 1; k <= n; ++k)
if (k != i && k != j)
++occur[is_clockwise(i, j, k)];
if (!occur[0] || !occur[1]) {
hull.insert(i);
hull.insert(j);
}
}
give_answer(hull.size());
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |