# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1902 | mh5664 | 최댓값 (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>
FILE *in = fopen ("input.txt", "r"), *out = fopen ("output.txt", "w");
int GetMax (int n, int a[11])
{
int max = -2147483647;
for (int i = 0; i < n; ++i)
{
if (max < a[i])
{
max = a[i];
}
}
return max;
}
int main ()
{
int n, data[11];
fscanf (in, "%d", &n);
for (int i = 0; i < n; ++i)
{
fscanf (in, "%d", &data[i]);
}
fprintf (out, "%d", GetMax (n, data));
fclose (in);
fclose (out);
return 0;
}