# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
17097 |
2015-11-05T17:05:10 Z |
pscheol |
최댓값 (tutorial2) |
C |
|
0 ms |
1084 KB |
GetMax(int N, int *A) {
int i = 0;
int max = A[N];
while (N-- != 0) {
max = max > A[N] ? max : A[N];
}
return max;
}
# |
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 |
Incorrect |
0 ms |
1084 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |