# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
513 | jwvg0425 | 최댓값 (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 GetMax(N, A)
{
int i,m=A[0];
for(i=1;i<N;i++)
{
if(A[i]>m)m=A[i];
}
return m;
}
int main()
{
int n,a[10],i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
printf("%d",GetMax(n,a));
}