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