# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
874014 | 2023-11-16T07:46:18 Z | salmon | Friend (IOI14_friend) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; int findSample(int N, int confidence[], int host[], int protocol[]); int cas = 0; for(int i = 1; i < N; i++){ if(protocol[i] != 2){ cas = 1; } } if(cas == 0){ int big = 0; for(int i = 0; i < N; i++){ big = max(big,onfidence[i]); } return big; } }