Submission #585015

#TimeUsernameProblemLanguageResultExecution timeMemory
585015JomnoiTriangles (CEOI18_tri)C++17
0 / 100
1 ms308 KiB
#include <bits/stdc++.h> #include "trilib.h" using namespace std; const int MAX_N = 505; bool mark[MAX_N][MAX_N]; int main() { int N = get_n(); for(int i = 1; i <= N; i++) { for(int j = i + 1; j <= N; j++) { for(int k = 1; k <= N; k++) { if(k != i and k != j and is_clockwise(k, i, j) == true) { mark[i][j] = true; } } } } set <int> s; for(int i = 1; i <= N; i++) { for(int j = i + 1; j <= N; j++) { if(mark[i][j] == false) { s.insert(i); s.insert(j); } } } give_answer(s.size()); return 0; }
#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...