题解 | 兔子的序列

#include <stdio.h>
#include <math.h>
int main() {
    int n, arr[1000];
    scanf("%d", &n);
    int max=0;
    for (int i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
        int a = sqrt(arr[i]);
        if(a*a!=arr[i] && arr[i]>max)
        {
            max=arr[i];
        }
    }
    printf("%d", max);
    return 0;
}