# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
16064 |
2015-08-15T10:57:27 Z |
paruru |
최댓값 (tutorial2) |
C++ |
|
0 ms |
1084 KB |
#define oo 987654321
int max_value=-oo;
int GetMax(int N, int *A){
for(int i=0;i<N;i++)
{
if(A[i]>max_value)
max_value=A[i];
}
return max_value;
}
# |
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 |