A. Perfect Squares
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.
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.
Print the largest number in the array which is not a perfect square. It is guaranteed that an answer always exists.
2 4 2
2
8 1 2 4 8 16 32 64 576
32
In the first sample case, 4 is a perfect square, so the largest number in the array that is not a perfect square is 2.
题意:首先输入一个数n,然后陆续输入n个数,输出n个数中最大的非平方数
考点:测试数据较大,数据定义需用 long long;输入输出用 cin & cout 。
#include<bits/stdc++.h> //万能头文件,在国外及国内大多oj皆可用,Hdu 和 Poj 不可用
using namespace std;
long long sq(long long n)
{
if((long long)sqrt(n)*(long long)sqrt(n)!=n)
return 1;
}
int main()
{
long long n;
long long x,ans=LONG_LONG_MIN,i; //LONG_LONG_MIN 为long long 中最小值
cin>>n;
for(i=0; i<n; i++)
{
cin>>x;
if(sq(x))
ans=max(x,ans);
}
cout<<ans<<endl;
}