# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
19220 |
2016-02-21T09:59:04 Z |
LK149 |
최댓값 (tutorial2) |
C++ |
|
0 ms |
1084 KB |
int GetMax(int N, int *A){
int i=1;
while(i<N){
A[0]=(A[0]<A[i])?A[i]:A[0];
i++;
}
return A[0];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1084 KB |
Output is correct |
2 |
Correct |
0 ms |
1084 KB |
Output is correct |
3 |
Correct |
0 ms |
1084 KB |
Output is correct |
4 |
Correct |
0 ms |
1084 KB |
Output is correct |
5 |
Correct |
0 ms |
1084 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1084 KB |
Output is correct |
2 |
Correct |
0 ms |
1084 KB |
Output is correct |
3 |
Correct |
0 ms |
1084 KB |
Output is correct |
4 |
Correct |
0 ms |
1084 KB |
Output is correct |
5 |
Correct |
0 ms |
1084 KB |
Output is correct |