VJ2-Perfect Squares

最新推荐文章于 2020-02-17 21:26:49 发布

原创最新推荐文章于 2020-02-17 21:26:49 发布 · 247 阅读

0 ·

CC 4.0 BY-SA版权

Java算法练习专栏收录该内容

51 篇文章

订阅专栏

本文介绍了一种算法，用于从整数数组中找出最大的非完全平方数。输入为包含正负整数的数组，输出为该数组中最大的非完全平方数值。通过遍历数组并利用数学方法判断每个元素是否为完全平方数来实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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);
    }
}