# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1184320 | TroySer | Friend (IOI14_friend) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "friend.h"
using namespace std;
using ll = long long;
// Find out best sample
ll findSample(ll n, ll confidence[], ll host[], ll protocol[]) {
ll ans=10;
return ans;
}
// const ll MAX_N = 1e5;
// ll confidence[MAX_N];
// ll host[MAX_N];
// ll protocol[MAX_N];
// int main() {
// ll N;
// cin >> N;
// for (ll i = 0; i < N; i++) cin >> confidence[i];
// for (ll i = 1; i < N; i++) {
// cin >> host[i] >> protocol[i];
// }
// ll res = findSample(N, confidence, host, protocol);
// cout << "Output: " << res << endl;
// }