# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
425004 | A_D | Triangles (CEOI18_tri) | C++14 | 1 ms | 204 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 "trilib.h"
#include <bits/stdc++.h>
#define ii pair<int,int>
#define F first
#define S second
#define du long double
using namespace std;
int n;
bool ok(int i,int j)
{
int cnt=0;
for(int k=1;k<=n;k++){
if(k==i||k==j)continue;
int b=is_clockwise(i,j,k);
cnt|=(1<<b);
}
return cnt<3;
}
void solve()
{
n=get_n();
int ans=0;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(i==j)continue;
if(ok(i,j))ans+=2;
}
}
give_answer(ans);
}
main()
{
int t=1;
while(t--)solve();
//cin>>t;
}
Compilation message (stderr)
# | 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... |