제출 #152491

#제출 시각아이디문제언어결과실행 시간메모리
152491balbit친구 (IOI14_friend)C++14
8 / 100
3 ms380 KiB
#include <bits/stdc++.h> #ifndef LOCAL #include <friend.h> #endif using namespace std; #define ll long long #define pii pair<int, int> #define pll pair<ll, ll> #define SZ(x) (int)(x.size()) #define ALL(x) x.begin(),x.end() #define FOR(i,a,b) for (int i=a; i<b; i++) #define REP(i,n) FOR(i,0,n) #define RREP(i,n) for (int i = n-1; i>=0; i--) #define MX(a,b) a = max(a, (__typeof__(a)),b) #define MN(a,b) a = min(a, (__typeof__(a)),b) //#define int ll int findSample(int n, int confidence[], int host[], int protocol[]){ ll re = 0; REP(i,n){ re += confidence[i]; } return re; } #ifdef LOCAL int c [ 5 ] = {1,2,3,4,5}; int f[3], p[3]; signed main(){ cout<<findSample(5,c,f,p)<<endl; } #endif
#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...