제출 #739214

#제출 시각아이디문제언어결과실행 시간메모리
739214NeroZeinFriend (IOI14_friend)C++17
8 / 100
1 ms212 KiB
#include "friend.h" #include <bits/stdc++.h> using namespace std; const int N = 1003; int n; int a[N]; int findSample(int n_, int confidence[],int host[],int protocol[]){ n = n_; int ans = 0; for (int i = 0; i < n; ++i) { a[i] = confidence[i]; ans = max(ans, a[i]); } return ans; }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...