제출 #43877

#제출 시각아이디문제언어결과실행 시간메모리
43877faustaadpFriend (IOI14_friend)C++17
8 / 100
3 ms1284 KiB
#include "friend.h"
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
ll i,ma;
// Find out best sample
int findSample(int n,int confidence[],int host[],int protocol[]){
	for(i=0;i<n;i++)
		ma=max(ma,(ll)confidence[i]);
	return ma;
}
#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...