package zh.codegym.task.task05.task0532;
import java.io.*;
/*
有关算法的任务
*/
public class Solution {
public static void main(String[] args) throws Exception {
int maximum = 0,count=0,n=0;
//在此编写你的代码
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
while(true){
int num = Integer.parseInt(br.readLine());
count += 1;
if(num<= 0)
{
n = 0;
break;
}
if(count == 1)
n = num;
else
maximum = maximum>=num ? maximum:num;
if(count == n+1)
break;
}
if(n != 0)
System.out.println(maximum);
}
}
package zh.codegym.task.task05.task0532;
import java.io.*;
/*
有关算法的任务
*/
public class Solution {
public static void main(String[] args) throws Exception {
int maximum = 0,count=0,n=0;
//在此编写你的代码
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
while(true){
int num = Integer.parseInt(br.readLine());
count += 1;
if(num<= 0)
{
n = 0;
break;
}
if(count == 1)
n = num;
else
maximum = maximum>=num ? maximum:num;
if(count == n+1)
break;
}
if(n != 0)
System.out.println(maximum);
}
}