SOJ.The hardest problem

1157. The hardest problem

限制条件

时间限制: 1 秒, 内存限制: 32 兆

题目描述

In the final exam, you are given n problems to solve, each one of which has an integer value indicating its difficulty, the larger, the harder. You need to find out which problem is the hardest.

输入格式

Input may contain several test cases, one per line. For each test case, the first integer indicates n (1<=n<=4), the number of problems. And then n signed 32-bit integers follow. A case with n=0 indicates the end of input, which should not be processed.

输出格式

For each test case, you must output the difficulty value of the hardest problem in a single line.

样例输入

1 12 1 23 1 3 24 1 2 3 40

样例输出

1234

#include 
     
     
      
      
int main()
{
    int n, i, a, max;
    while(scanf("%d", &n) && n)
    {
        for(i = 0; i < n; i++)
        {
            scanf("%d", &a);
            if (i == 0)
                max = a;
            else
                max = max > a? max : a;
        }
        printf("%d\n", max);
        max = 0;
    }
    return 0;
}