Submission #267106

#TimeUsernameProblemLanguageResultExecution timeMemory
267106pedroslreyTriangles (CEOI18_tri)C++17
35 / 100
610 ms516 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...