제출 #1064747

#제출 시각아이디문제언어결과실행 시간메모리
1064747Gray친구 (IOI14_friend)C++17
8 / 100
1 ms348 KiB
#include "friend.h" #include<bits/stdc++.h> #define ll long long #define ff first #define ss second #define ln "\n" #define ld long double using namespace std; int findSample(int n,int confidence[],int host[],int protocol[]){ int ans=0; for (int i=0; i<n; i++) ans=max(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...