제출 #111945

#제출 시각아이디문제언어결과실행 시간메모리
111945luciocf친구 (IOI14_friend)C++14
16 / 100
3 ms384 KiB
#include <bits/stdc++.h> #include "friend.h" using namespace std; int findSample(int n, int confidence[], int host[], int protocol[]) { if (protocol[1] == 2) { int mx = 0; for (int i = 0; i < n; i++) mx = max(mx, confidence[i]); return mx; } int s = 0; for (int i = 0; i < n; i++) s += confidence[i]; return s; }
#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...