| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 693 | kws7327 | 최댓값 (tutorial2) | C++98 | 0 ms | 0 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
int M(int n, int *a){
    int i,max=0;
    for (i=0;i<n;i++)if(max<a[i])max=a[i];
    return max;
}
