| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 692 | 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.
#include <stdio.h>
int main(){
  int a[101];
  int i,n,max=0;
  scanf("%d",&n);
  for(i=0;i<n;i++){scanf("%d",&a[i]);if(max<a[i])max=a[i];}
  printf("%d",max);
return 0;
}
