题解 | #兔子的序列#

#include <iostream>
#include <cmath>
#include <string>
using namespace std;

int main() {
    long int n;
    cin>>n;
    long int a[n];
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    int max= 0;

    for(int i=0;i<n;i++){
        if(sqrt(a[i])!=static_cast<int>(sqrt(a[i])) && a[i]>max){
            max = a[i];
        }
    }

    cout<<max;
}