제출 #428471

#제출 시각아이디문제언어결과실행 시간메모리
428471TLP39Friend (IOI14_friend)C++14
8 / 100
1 ms264 KiB
#include "friend.h"

// 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+=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...