| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1161213 | 12345678 | Triangles (CEOI18_tri) | C++20 | 2208 ms | 652 KiB |
#include <bits/stdc++.h>
#include "trilib.h"
using namespace std;
const int nx=505;
int n, cnt;
int main()
{
n=get_n();
for (int i=1; i<=n; i++)
{
int cur=1, con=1;
if (cur==i) cur=2;
for (int j=1; j<=n; j++)
{
if (i==j||j==cur) continue;
if (is_clockwise(i, cur, j)) cur=j;
}
for (int j=1; j<=n; j++)
{
if (i==j||j==cur) continue;
if (is_clockwise(i, cur, j)) con=0;
}
cnt+=con;
}
give_answer(cnt);
return 0;
}
/*
6
1 1
4 3
2 2
1 4
5 1
3 2
*/| # | 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... | ||||
