# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
404162 | peuch | Friend (IOI14_friend) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "friend.h"
// Find out best sample
int findSample(int n,int confidence[],int host[],int protocol[]){
int maxi = 0;
for(int i = 0; i < n; i++)
maxi = max(confidence[i], maxi);
return sum;
}