# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
585107 | krit3379 | Triangles (CEOI18_tri) | C++17 | 0 ms | 0 KiB |
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;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define N 55
int d[N][N][N],c[2];
int main(){
int n,i,j,k,ans;
n=nget_n();
assert(n<=50);
for(i=1;i<=n;i++)for(j=i+1;j<=n;j++)for(k=1;k<=n;k++){
if(k==i||k==j)continue;
d[i][j][k]=is_clockwise(i,j,k);
}
for(i=1;i<=n;i++)for(j=i+1;j<=n;j++){
c[0]=c[1]=0;
for(k=1;k<=n;k++){
if(k==i||k==j)continue;
c[d[i][j][k]]++;
}
if(!c[0]||!c[1])ans++;
}
give_answer(ans);
return 0;
}