A. Perfect Squares
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Given an array a1,?a2,?...,?an of n integers, find the largest number in the array that is not a perfect square.
A number x is said to be a perfect square if there exists an integer y such that x?=?y2.
Input
The first line contains a single integer n (1?≤?n?≤?1000) — the number of elements in the array.
The second line contains n integers a1,?a2,?...,?an (?-?106?≤?ai?≤?106) — the elements of the array.
It is guaranteed that at least one element of the array is not a perfect square.
Output
Print the largest number in the array which is not a perfect square. It is guaranteed that an answer always exists.
Examples
input
2 4 2
output
2
input
8 1 2 4 8 16 32 64 576
output
32
import java.util.Scanner;public class Main{public static void main(String []args){int n;Scanner s = new Scanner(System.in);n = s.nextInt();int ans = (int)-1e8;System.out.println(ans);while(n--!=0){int tmp;tmp = s.nextInt();if((int)Math.sqrt(tmp)*(int)Math.sqrt(tmp)!=tmp)ans = Math.max(tmp, ans);}System.out.println(ans);}
}