# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
4961 |
2014-01-23T15:59:50 Z |
lingxiang |
최댓값 (tutorial2) |
C++ |
|
0 ms |
1088 KB |
#include<stdio.h>
int GetMax(int N,int a[]){
int max=0;
for(int i=0;i<N;i++){
if(a[i]>=max) max=a[i];
}
return max;
}
# |
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 |