| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 4939 | jumax1008 | 최댓값 (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 <cstdio>
int main()
{
  FILE *fp=fopen("example.in","r");
  int n,in[10],m=0;
  fscanf(fp,"%d",&n);
  
  for(int i=0 ; i<n;  i++)
  {  fscanf(fp,"%d",&in[i]);
   if(m<in[i])
     m=in[i];
  }
  fclose(fp);
  fp = fopen("example.out","w");
  fprintf(fp,"%d",m);
  return 0;
}
