# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
3243 |
2013-08-29T13:55:09 Z |
jays |
최댓값 (tutorial2) |
C++ |
|
0 ms |
1088 KB |
int GetMax(int N, int* A) {
int ret = A[0];
for (int i = 1; i < N; ++i)
if (A[i] > ret)
ret = A[i];
return ret;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1088 KB |
Output is correct |
2 |
Correct |
0 ms |
1088 KB |
Output is correct |
3 |
Correct |
0 ms |
1088 KB |
Output is correct |
4 |
Correct |
0 ms |
1088 KB |
Output is correct |
5 |
Correct |
0 ms |
1088 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1088 KB |
Output is correct |
2 |
Correct |
0 ms |
1088 KB |
Output is correct |
3 |
Correct |
0 ms |
1088 KB |
Output is correct |
4 |
Correct |
0 ms |
1088 KB |
Output is correct |
5 |
Correct |
0 ms |
1088 KB |
Output is correct |