제출 #1146550

#제출 시각아이디문제언어결과실행 시간메모리
1146550why1Triangles (CEOI18_tri)C++20
0 / 100
0 ms324 KiB
#include <bits/stdc++.h> #include "trilib.h" using namespace std; #define ll long long #define pb push_back #define pii pair<int,int> #define sz size() #define all(v) v.begin(),v.end() #define fi first #define se second const int N = 5e5; const int mod = 1e9+7; const ll INF = 1e18; const int di[] = {1, -1, 0, 0}; const int dj[] = {0, 0, 1, -1}; void solve() { int n=get_n(); int ans=0; for(int i = 1; i <= n; i++){ for(int j = i+1; j <= n; j++){ bool check=true; for(int k = 1; k <= n; k++){ if(k!=i && k!=j && i!=j){ if(!is_clockwise(i,j,k)){ check=false; break; } } } ans+=check; } } give_answer(ans-1); } int main() { //freopen("cowrun.in","r",stdin); //freopen("cowrun.out","w",stdout); ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int t=1; //cin>>t; while(t--) { solve(); } 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...