제출 #1066249

#제출 시각아이디문제언어결과실행 시간메모리
1066249Mardonbekhazratov친구 (IOI14_friend)C++17
8 / 100
1 ms440 KiB
#include "friend.h" #include <algorithm> // Find out best sample int findSample(int n,int confidence[],int host[],int protocol[]){ int ans=0; for(int i=0;i<n;i++) ans=std::max(ans,confidence[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...